perm filename W90JNK[JNK,JMC] blob
sn#883362 filedate 1990-03-27 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00455 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00074 00002
C00075 00003 ∂03-Jan-90 0626 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SODA deadline
C00083 00004 ∂03-Jan-90 0646 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Bryant's algorithms
C00086 00005 ∂03-Jan-90 0647 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU polynomial interpolation
C00089 00006 ∂03-Jan-90 0651 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Job Announcement
C00095 00007 ∂03-Jan-90 1024 bates@sierra.STANFORD.EDU Course Announcement
C00096 00008 ∂03-Jan-90 1035 bates@sierra.STANFORD.EDU Course Announcement
C00098 00009 ∂03-Jan-90 1058 bates@sierra.STANFORD.EDU previous message
C00100 00010 ∂03-Jan-90 1118 betsy@russell.Stanford.EDU NIH Grant Application Workshop
C00103 00011 ∂03-Jan-90 1931 LOGMTC-mailer POPL visitors
C00105 00012 ∂04-Jan-90 0715 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Average running time of a simple algorithm
C00110 00013 ∂04-Jan-90 1132 @Polya.Stanford.EDU:hemenway@Sunburn.Stanford.EDU Calendar Advisory
C00114 00014 ∂04-Jan-90 1210 @Polya.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu distribution
C00116 00015 ∂04-Jan-90 1214 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU logarithms of algebraic numbers
C00119 00016 ∂04-Jan-90 1233 @Polya.Stanford.EDU,@coraki.stanford.edu,@Polya.Stanford.EDU:jcm@iswim.Stanford.EDU Re: distribution
C00122 00017 ∂04-Jan-90 1247 @Polya.Stanford.EDU,@coraki.stanford.edu:RPG@SAIL.Stanford.EDU re: distribution
C00124 00018 ∂04-Jan-90 1252 LOGMTC-mailer POPL visitors -- update
C00126 00019 ∂04-Jan-90 1344 @Polya.Stanford.EDU:hemenway@Sunburn.Stanford.EDU ["Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU> : Calendar
C00131 00020 ∂04-Jan-90 1344 ingrid@russell.Stanford.EDU CSLI Calendar, 4 January 1990, vol. 5:11
C00136 00021 ∂04-Jan-90 1409 @Polya.Stanford.EDU,@coraki.stanford.edu:dill@amadeus.Stanford.EDU admissions committee
C00138 00022 ∂04-Jan-90 1421 LOGMTC-mailer A logic seminar
C00140 00023 ∂04-Jan-90 1658 LOGMTC-mailer MSRI seminar listing for January 8 - 12, 1990
C00143 00024 ∂05-Jan-90 0708 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STUDY OF CONSCIOUSNESS WITHIN SCIENCE--INTL' CONFERENCE
C00153 00025 ∂05-Jan-90 0709 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary of replies for PD theorem prover
C00160 00026 ∂05-Jan-90 0939 keyes@sierra.STANFORD.EDU EE Faculty Meeting
C00161 00027 ∂05-Jan-90 1135 LOGMTC-mailer talks
C00163 00028 ∂05-Jan-90 1359 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: PD theorem prover
C00166 00029 ∂05-Jan-90 1715 LOGMTC-mailer darlington seminar, 1/10, 4:15pm, ej228, sri
C00170 00030 ∂05-Jan-90 1715 LOGMTC-mailer darlington seminar, 1/10, 4:15pm, ej228, sri
C00174 00031 ∂08-Jan-90 1013 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Max Indep Set
C00177 00032 ∂08-Jan-90 1124 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CFP: MFCS '90
C00184 00033 ∂08-Jan-90 1403 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Max Indep Set
C00187 00034 ∂08-Jan-90 1417 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU extrapolation of weighted points in a plane (whew!)
C00191 00035 ∂08-Jan-90 1424 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU S. Wolfram and computational irreducibility
C00200 00036 ∂08-Jan-90 1527 ingrid@russell.Stanford.EDU New Visitor
C00202 00037 ∂08-Jan-90 1657 ingrid@russell.Stanford.EDU CSLI events tomorrow
C00207 00038 ∂09-Jan-90 0119 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM A&S trivium
C00212 00039 ∂09-Jan-90 0815 LOGMTC-mailer seminar
C00215 00040 ∂09-Jan-90 0844 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary of response to Maximum Weight Matchings request.
C00220 00041 ∂09-Jan-90 0844 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Fellowship and job openings
C00225 00042 ∂09-Jan-90 0844 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Program Change in Northeastern's Theory Day, Jan. 19
C00230 00043 ∂09-Jan-90 1337 NA.PHL@Forsythe.Stanford.EDU Sunrise Club, Jan. 23rd
C00233 00044 ∂09-Jan-90 1337 spicer@sierra.STANFORD.EDU
C00235 00045 ∂09-Jan-90 1739 LOGMTC-mailer Program Tranformation Seminar Reminder, ej228, 4:15pm weds.
C00237 00046 ∂10-Jan-90 0729 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Max Indep Set
C00240 00047 ∂10-Jan-90 0730 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGAL International Symposium on Algorithms, Tokyo, Japan, 1990
C00247 00048 ∂10-Jan-90 1555 ingrid@russell.Stanford.EDU CSLI Calendar, 11 January 1990, vol. 5:12
C00259 00049 ∂11-Jan-90 0738 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for papers: COLT '90
C00267 00050 ∂11-Jan-90 0743 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Symp. on Principles of Database Systems
C00290 00051 ∂11-Jan-90 0751 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU Meeting time poll
C00292 00052 ∂11-Jan-90 0755 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Any previous work on space-efficient, time-efficient tries?
C00295 00053 ∂11-Jan-90 0758 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Knights Tour : Proof of Correctness
C00299 00054 ∂11-Jan-90 0758 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Approx. string matching
C00302 00055 ∂11-Jan-90 0802 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Models of Lambda Calculus
C00306 00056 ∂11-Jan-90 0802 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Max. Indep. Set
C00310 00057 ∂11-Jan-90 0850 LOGMTC-mailer reminder -- seminar today
C00311 00058 ∂11-Jan-90 1111 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Parallel complexity reference needed
C00316 00059 ∂11-Jan-90 1111 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Help with a reference
C00319 00060 ∂11-Jan-90 1148 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU MS in algorithm analysis ?
C00322 00061 ∂11-Jan-90 1148 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Approx. string matching
C00328 00062 ∂11-Jan-90 1418 helen@russell.Stanford.EDU Grades
C00330 00063 ∂11-Jan-90 1632 LOGMTC-mailer Seminar time/room change
C00332 00064 ∂11-Jan-90 1641 LOGMTC-mailer Topic correction
C00334 00065 ∂11-Jan-90 2227 hellman@isl.Stanford.EDU Admissions
C00337 00066 ∂12-Jan-90 0831 LOGMTC-mailer seminar
C00340 00067 ∂12-Jan-90 0856 eisensee@sierra.STANFORD.EDU Solid State Seminar - AKA EE430
C00343 00068 ∂12-Jan-90 1046 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Neural Net Course
C00351 00069 ∂12-Jan-90 1120 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for Papers -- Neural Networks for Automatic Target
C00359 00070 ∂12-Jan-90 1121 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU DISO 90
C00371 00071 ∂12-Jan-90 1124 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGUCCS CALL for PARTICIPATION
C00397 00072 ∂12-Jan-90 1452 hemenway@Sunburn.Stanford.EDU First Meeting
C00399 00073 ∂14-Jan-90 1028 grundy@csli.Stanford.EDU The Symbolic Systems Forum (New time and place)
C00403 00074 ∂14-Jan-90 1933 LOGMTC-mailer Talks Tuesday
C00410 00075 ∂15-Jan-90 1921 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU AFLB this week
C00414 00076 ∂16-Jan-90 0903 LOGMTC-mailer seminar reminder
C00415 00077 ∂16-Jan-90 1112 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGACT News reminder
C00418 00078 ∂16-Jan-90 1114 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU summary of replies to query about fp PhD programs
C00422 00079 ∂16-Jan-90 1518 LOGMTC-mailer New seminar
C00424 00080 ∂17-Jan-90 1533 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Categorical Combinators
C00428 00081 ∂17-Jan-90 1536 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Horn clauses
C00431 00082 ∂17-Jan-90 1607 ingrid@russell.Stanford.EDU CSLI Calendar, 18 January 1990, 5:13←∞
C00445 00083 ∂17-Jan-90 1658 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU REFERENCES on Reflection
C00456 00084 ∂17-Jan-90 1757 grundy@csli.Stanford.EDU Symbolic Systems Forum schedule for winter quarter
C00461 00085 ∂18-Jan-90 0701 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Another Change in the Northeastern University Theory Day Program
C00464 00086 ∂18-Jan-90 0709 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Seminar, Tel Aviv University, Israel, Friday, Jan 19
C00474 00087 ∂18-Jan-90 0713 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Bipartite Subgraphs...
C00479 00088 ∂18-Jan-90 0756 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU Reminder: AFLB at 12:00 (note new time)
C00483 00089 ∂18-Jan-90 1207 tobagi@bodega.Stanford.EDU Dr. S. Bedrosian, U of Penn
C00485 00090 ∂18-Jan-90 1222 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU DIMACS
C00488 00091 ∂18-Jan-90 1422 ingrid@russell.Stanford.EDU Talk Announcement for Friday, 19 January, 1:30 p.m.
C00490 00092 ∂18-Jan-90 1429 LOGMTC-mailer seminar
C00493 00093 ∂19-Jan-90 1216 ingrid@russell.Stanford.EDU Language Acquisition Interest Group Meetings
C00496 00094 ∂19-Jan-90 2253 grundy@csli.Stanford.EDU Symbolic Systems Forum January 25
C00499 00095 ∂21-Jan-90 2138 LOGMTC-mailer Seminar reminders
C00503 00096 ∂22-Jan-90 0812 LOGMTC-mailer seminar reminder
C00504 00097 ∂22-Jan-90 0833 eisensee@sierra.STANFORD.EDU Solid State Seminar
C00506 00098 ∂22-Jan-90 0923 LOGMTC-mailer MSRI seminars for 1/22 - 1/26/90
C00511 00099 ∂22-Jan-90 1123 @RELAY.CS.NET:mazzetti@ed.aaai.org prize paper award - part 1 of 2
C00524 00100 ∂22-Jan-90 1126 @RELAY.CS.NET:mazzetti@ed.aaai.org prize paper award - part 2 of 2
C00566 00101 ∂22-Jan-90 1509 LOGMTC-mailer Hughes seminar
C00569 00102 ∂22-Jan-90 1523 LOGMTC-mailer Hughes seminar
C00572 00103 ∂22-Jan-90 1643 ingrid@russell.Stanford.EDU Seminar on Computers, Design, and Work - 1/24/1990
C00575 00104 ∂22-Jan-90 1650 cutkosky@cnc-sun.Stanford.EDU C.S. 329/ M.E. 390 schedule
C00580 00105 ∂22-Jan-90 2043 forbus@cs.uiuc.edu prize paper award - part 1 of 2
C00585 00106 ∂23-Jan-90 1210 grundy@csli.Stanford.EDU Forum room change
C00589 00107 ∂24-Jan-90 1627 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU minimizing sum of k largest linear functions
C00593 00108 ∂24-Jan-90 1629 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Suggestions needed
C00599 00109 ∂24-Jan-90 1631 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parallel graph reduction and combinators
C00602 00110 ∂24-Jan-90 1627 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Computer Science Logic - Call for Papers
C00608 00111 ∂24-Jan-90 1628 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Positions at Ecole Normale Superieure de Lyon
C00612 00112 ∂24-Jan-90 1633 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STOC 1990
C00630 00113 ∂24-Jan-90 1633 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU AFLB on Thursday
C00633 00114 ∂24-Jan-90 1635 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU generating random regular graphs
C00636 00115 ∂24-Jan-90 1641 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU IMA Conference on the Unified Computation Laboratory
C00645 00116 ∂24-Jan-90 1640 ingrid@russell.Stanford.EDU CSLI Calendar, 25 January, vol. 5:14
C00667 00117 ∂24-Jan-90 1652 LOGMTC-mailer Dan Yellin/ IBM
C00669 00118 ∂24-Jan-90 1658 LOGMTC-mailer Admissible sets and structures
C00671 00119 ∂25-Jan-90 0719 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CFGs with few nonterminals
C00674 00120 ∂25-Jan-90 0720 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Info Request: Algebraic approaches to Finite Automata
C00677 00121 ∂25-Jan-90 0720 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU List of Research Reports from LIP-IMAG, Lyon, France
C00685 00122 ∂25-Jan-90 0720 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Grammar classes between the levels of the Chomsky hierarchy ?
C00689 00123 ∂25-Jan-90 0721 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ISCIS5 CALL FOR PAPER
C00695 00124 ∂25-Jan-90 0721 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Cube-Connected Cycles
C00699 00125 ∂25-Jan-90 0722 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Randomness vs complexity of a sequence
C00708 00126 ∂25-Jan-90 0944 LOGMTC-mailer Admissible sets and structures
C00710 00127 ∂25-Jan-90 1357 carlstea@sierra.STANFORD.EDU Informal seminar - today
C00712 00128 ∂25-Jan-90 1423 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Strong Fairness Paper
C00716 00129 ∂26-Jan-90 1418 helen@russell.Stanford.EDU CSLI-SSP Summer Internships
C00720 00130 ∂26-Jan-90 1451 keyes@sierra.STANFORD.EDU FACULTY MEETING
C00721 00131 ∂27-Jan-90 1946 grundy@csli.Stanford.EDU The Symbolic Systems Forum
C00724 00132 ∂28-Jan-90 1249 hemenway@Sunburn.Stanford.EDU Meeting Reminder
C00725 00133 ∂28-Jan-90 1310 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU McCluskey Honor
C00727 00134 ∂28-Jan-90 2036 snoeyink@Neon.Stanford.EDU BATS at berkeley, feb 16
C00729 00135 ∂29-Jan-90 0723 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Hamiltonian cycles in 4-connected planar graphs
C00732 00136 ∂29-Jan-90 0723 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU P = NP? (The Dilemma is Re-Solved)
C00736 00137 ∂29-Jan-90 0723 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Parallel Computation Day at NYU
C00740 00138 ∂29-Jan-90 0727 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU A Reccurrence Relation
C00743 00139 ∂29-Jan-90 0743 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU IEEE Symposium on Logic in Computer Science
C00753 00140 ∂29-Jan-90 0800 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Education Search
C00756 00141 ∂29-Jan-90 0926 eisensee@sierra.STANFORD.EDU Solid State Lab Seminar
C00759 00142 ∂29-Jan-90 1048 ingrid@russell.Stanford.EDU Seminar on Computers, Design, and Work - Wed, 31 Jan, 12:15
C00763 00143 ∂29-Jan-90 1154 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SUMMARY - Between the levels of the Chomsky hierarchy
C00781 00144 ∂29-Jan-90 1336 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU FOCS'90 Call for Papers
C00789 00145 ∂29-Jan-90 1426 chandler@Sunburn.Stanford.EDU Current CV
C00791 00146 ∂29-Jan-90 1432 LOGMTC-mailer tuesday seminar
C00794 00147 ∂29-Jan-90 1527 chandler@Sunburn.Stanford.EDU Dept. of the Navy Publication
C00796 00148 ∂29-Jan-90 1519 helen@russell.Stanford.EDU [Brendan Busch <G.GONESKIING@Macbeth.Stanford.EDU>: programming work]
C00799 00149 ∂29-Jan-90 1940 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU AFLB this Thursday
C00803 00150 ∂29-Jan-90 2255 LOGMTC-mailer CFP: Computer Science Logic
C00808 00151 ∂30-Jan-90 0756 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Conference Announcement - CTRS90
C00816 00152 ∂30-Jan-90 0759 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Post STOC workshop -- Workshop on Parallel Algorithms
C00825 00153 ∂30-Jan-90 0801 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Monkey puzzles and NP-completeness
C00829 00154 ∂30-Jan-90 0802 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU FOCS'90 Call for Papers
C00837 00155 ∂30-Jan-90 0925 chandler@Sunburn.Stanford.EDU Today's Faculty Lunch
C00839 00156 ∂30-Jan-90 1109 jimenez@Sunburn.Stanford.EDU IBM
C00842 00157 ∂30-Jan-90 1144 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU 25th Anniversary
C00848 00158 ∂30-Jan-90 2043 jones@Sunburn.Stanford.EDU Mathematica
C00849 00159 ∂31-Jan-90 0856 hemenway@Sunburn.Stanford.EDU Round 1
C00852 00160 ∂31-Jan-90 0931 tom@Sunburn.Stanford.EDU chilled water shutdown
C00854 00161 ∂31-Jan-90 1003 hemenway@Sunburn.Stanford.EDU Round 1 Meeting
C00857 00162 ∂31-Jan-90 1126 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Round 1 Meeting
C00859 00163 ∂31-Jan-90 1334 ingrid@russell.Stanford.EDU CSLI Calendar, 1 February 1990, vol. 5:15
C00876 00164 ∂31-Jan-90 1425 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CAAP/ESOP final programme, Copenhagen, May 15-18, 1990
C00900 00165 ∂31-Jan-90 1532 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 6 February, 7:30 p.m.
C00909 00166 ∂31-Jan-90 1638 keyes@sierra.STANFORD.EDU An Invitation to meet the VISITING COMMITTEE
C00911 00167 ∂31-Jan-90 1650 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU workshop on algorithmic research in the midsouthwest
C00922 00168 ∂01-Feb-90 0958 LOGMTC-mailer MSRI seminars for Feb. 5 - 9 1990
C00926 00169 ∂01-Feb-90 1111 @RELAY.CS.NET:mazzetti@ed.aaai.org
C00937 00170 ∂01-Feb-90 1311 @Sunburn.Stanford.EDU:nakata@jessica.Stanford.EDU Portia status
C00942 00171 ∂01-Feb-90 1503 swartout@vaxa.isi.edu
C00945 00172 ∂01-Feb-90 1602 keyes@sierra.STANFORD.EDU Reminder of EE Faculty Meeting tomorrow, 2/2
C00946 00173 ∂01-Feb-90 1655 bobrow@pooh.parc.xerox.com Time Line for AI
C00950 00174 ∂01-Feb-90 2347 @Sunburn.Stanford.EDU:nakata@jessica.Stanford.EDU Portia downtime slightly modified
C00955 00175 ∂02-Feb-90 1147 stager@Sunburn.Stanford.EDU Preliminary Class Lists
C00957 00176 ∂02-Feb-90 1425 hemenway@Sunburn.Stanford.EDU Folders Ready
C00959 00177 ∂02-Feb-90 1457 chandler@Sunburn.Stanford.EDU CS Colloquium - 2/6/90
C00960 00178 ∂02-Feb-90 1508 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU 1990 CSD Retreat
C00963 00179 ∂02-Feb-90 1610 grundy@csli.Stanford.EDU The Symbolic Systems Forum
C00966 00180 ∂02-Feb-90 1627 gilberts@Sunburn.Stanford.EDU MJH Carpet Cleaning
C00968 00181 ∂03-Feb-90 0323 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU special issue of Algorithmica
C00973 00182 ∂03-Feb-90 0324 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Monkeys are NP-complete
C00978 00183 ∂03-Feb-90 1043 rgsmith@SLCS.SLB.COM
C00982 00184 ∂03-Feb-90 1809 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Mayr here for summer
C00985 00185 ∂04-Feb-90 1607 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Maryland Theoretical Computer Science Day
C00990 00186 ∂04-Feb-90 1723 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU faculty
C00994 00187 ∂05-Feb-90 0728 chandler@Sunburn.Stanford.EDU H. T. Kung.....
C00996 00188 ∂05-Feb-90 0755 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Turing 1990 Colloquium, 3-6 April 1990, Sussex University
C01009 00189 ∂05-Feb-90 0829 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU optimization problem relevant to boolean functions and set theory
C01020 00190 ∂05-Feb-90 1003 eisensee@sierra.STANFORD.EDU Solid State Seminar
C01023 00191 ∂05-Feb-90 1159 chandler@Sunburn.Stanford.EDU Forsythe Lectures
C01025 00192 ∂05-Feb-90 1206 @Sunburn.Stanford.EDU:nakata@jessica.Stanford.EDU Portia status (2/5/90)
C01030 00193 ∂05-Feb-90 1350 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Complexity questions on linear logic
C01034 00194 ∂05-Feb-90 1422 @Sunburn.Stanford.EDU,@Hudson.Stanford.EDU:jcm@iswim.Stanford.EDU statement of purpose
C01037 00195 ∂05-Feb-90 1429 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu statement of purpose
C01039 00196 ∂05-Feb-90 1437 hemenway@Sunburn.Stanford.EDU Statement of Purpose
C01041 00197 ∂05-Feb-90 1510 chandler@Sunburn.Stanford.EDU NSF Program Announcement and Guidelines
C01043 00198 ∂06-Feb-90 0029 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU This week's talk
C01047 00199 ∂06-Feb-90 0617 hellman@isl.Stanford.EDU Minority Mentoring
C01050 00200 ∂06-Feb-90 0826 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STACS '90, Rouen
C01072 00201 ∂06-Feb-90 1211 gilberts@Sunburn.Stanford.EDU MJH Carpets - Weekend
C01074 00202 ∂06-Feb-90 1211 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Packing problem, heuristics and algorithms
C01078 00203 ∂06-Feb-90 1331 chandler@Sunburn.Stanford.EDU NSF Directorate for CISE
C01079 00204 ∂06-Feb-90 1352 chandler@Sunburn.Stanford.EDU NSF Publications
C01081 00205 ∂06-Feb-90 1520 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Please send responses for Forum meal attendance. Urgent!
C01083 00206 ∂06-Feb-90 1535 keyes@sierra.STANFORD.EDU Cocktail Hour with the Visiting Committee, Feb. 7
C01085 00207 ∂06-Feb-90 1614 chandler@Sunburn.Stanford.EDU Votes
C01087 00208 ∂06-Feb-90 1719 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Logic Programming Summer School 1990
C01097 00209 ∂06-Feb-90 1826 LOGMTC-mailer Concurrency Seminar
C01100 00210 ∂07-Feb-90 0828 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Reges Talk
C01102 00211 ∂07-Feb-90 1049 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu email through (what's left of) the iron curtain
C01108 00212 ∂07-Feb-90 1547 @RELAY.CS.NET:mazzetti@ed.aaai.org
C01111 00213 ∂07-Feb-90 1552 @RELAY.CS.NET:mazzetti@ed.aaai.org
C01114 00214 ∂07-Feb-90 1657 hemenway@Sunburn.Stanford.EDU Round 1 Meeting Again
C01116 00215 ∂08-Feb-90 1044 @Sunburn.Stanford.EDU:JMC@SAIL.Stanford.EDU
C01117 00216 ∂08-Feb-90 1132 stager@Sunburn.Stanford.EDU 1990/91 Courses and Degrees
C01119 00217 ∂08-Feb-90 1501 hemenway@Sunburn.Stanford.EDU Round 1 Meeting Scheduled (for TUESDAY)
C01121 00218 ∂08-Feb-90 1643 LOGMTC-mailer tuesday seminars
C01123 00219 ∂08-Feb-90 1853 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU The Forum Needs YOUR help
C01129 00220 ∂08-Feb-90 1936 hemenway@Sunburn.Stanford.EDU Batch 3 & 4 Applications
C01131 00221 ∂08-Feb-90 2107 LOGMTC-mailer Lunchtime Logic discussion led by Prof. Mints: 12noon, Wed. Feb 14
C01133 00222 ∂09-Feb-90 0015 @RELAY.CS.NET:mazzetti@ed.aaai.org Point of clarification
C01136 00223 ∂09-Feb-90 0042 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU NIPS-90 WORKSHOPS Call for Proposals
C01144 00224 ∂09-Feb-90 0042 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Parallel graph reduction and lambda calculus replies
C01150 00225 ∂09-Feb-90 0045 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Monkeys are NP-complete
C01154 00226 ∂09-Feb-90 0101 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Cube-Connected Cycles
C01159 00227 ∂09-Feb-90 0102 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: CFGs with few nonterminals
C01170 00228 ∂09-Feb-90 0113 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Distributed Database Systems (Information Request)
C01174 00229 ∂09-Feb-90 0318 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU NIPS-90 CALL For Papers
C01185 00230 ∂09-Feb-90 0929 LOGMTC-mailer Reminder: Concurrency Seminar
C01186 00231 ∂09-Feb-90 0949 chandler@Sunburn.Stanford.EDU ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : Belated Happy
C01189 00232 ∂09-Feb-90 1022 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Defense Budget
C01193 00233 ∂09-Feb-90 1024 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU You are invited....
C01196 00234 ∂09-Feb-90 1115 wheaton@Sunburn.Stanford.EDU Announcement by the Provost
C01200 00235 ∂09-Feb-90 1148 gilberts@Sunburn.Stanford.EDU Carpet Cleaners Tonight
C01202 00236 ∂09-Feb-90 1347 chandler@Sunburn.Stanford.EDU Faculty Lunch
C01204 00237 ∂09-Feb-90 1521 wheaton@Sunburn.Stanford.EDU Laura Pollock
C01206 00238 ∂09-Feb-90 1645 ingrid@russell.Stanford.EDU CSLI Colloquium, Thursday, 15 February, 4:15 p.m., Ventura 17
C01210 00239 ∂09-Feb-90 1916 grundy@csli.Stanford.EDU Symbolic Systems Forum
C01216 00240 ∂09-Feb-90 2041 manning@sierra.STANFORD.EDU Quals result reviews
C01218 00241 ∂10-Feb-90 0352 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Advance Program: Computational Geometry Conference, Berkeley,
C01234 00242 ∂10-Feb-90 0738 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Structures Conference Preliminary Program
C01246 00243 ∂11-Feb-90 0332 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Structures Conference Preliminary Program
C01258 00244 ∂11-Feb-90 2153 LOGMTC-mailer Gilmore talk
C01260 00245 ∂12-Feb-90 0948 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU PODS-SIGMOD PROPOSAL
C01268 00246 ∂12-Feb-90 0955 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU PRG and lambda calculus
C01289 00247 ∂12-Feb-90 1000 stager@Sunburn.Stanford.EDU Final Exam Scheduling
C01292 00248 ∂12-Feb-90 1001 bergman@Sunburn.Stanford.EDU ["Ken Down" <HF.KSD@Forsythe.Stanford.EDU> : indirect cost rates ]
C01298 00249 ∂12-Feb-90 1004 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU More on Monkeys
C01306 00250 ∂12-Feb-90 1006 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Monkeys are NP-complete
C01309 00251 ∂12-Feb-90 1019 chandler@Sunburn.Stanford.EDU ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : Annual
C01316 00252 ∂12-Feb-90 1040 gerlach@sierra.STANFORD.EDU indirect cost rates
C01321 00253 ∂12-Feb-90 1104 chandler@Sunburn.Stanford.EDU Annual Forsythe Lectures
C01327 00254 ∂12-Feb-90 1126 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU New BITNET address for IBM Almaden
C01331 00255 ∂12-Feb-90 1228 betsy@russell.Stanford.EDU ["Michele Armstrong" <RS.MMA@Forsythe.Stanford.EDU>: New Indirect Cost Rates]
C01338 00256 ∂12-Feb-90 1719 snoeyink@Neon.Stanford.EDU BATS abstracts for friday
C01351 00257 ∂13-Feb-90 0715 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU WOBCATS meeting on February 26, 1990
C01361 00258 ∂13-Feb-90 0845 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU AFLB Thursday
C01365 00259 ∂13-Feb-90 0950 eisensee@sierra.STANFORD.EDU Solid State Lab Seminar
C01369 00260 ∂13-Feb-90 1349 hall@cis.Stanford.EDU SPECIAL SEMINAR
C01372 00261 ∂13-Feb-90 1428 littell@Sunburn.Stanford.EDU Fellowship supplement
C01374 00262 ∂14-Feb-90 1430 ingrid@russell.Stanford.EDU CSLI Calendar, 15 February, vol. 5:17
C01386 00263 ∂14-Feb-90 1709 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU California Competitive Technology Grants
C01395 00264 ∂15-Feb-90 0747 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU LICS prelim prgrm
C01406 00265 ∂15-Feb-90 0747 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU COLT '90 Call for Papers
C01414 00266 ∂15-Feb-90 0858 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : California Competitive Technology
C01421 00267 ∂15-Feb-90 1111 @Sunburn.Stanford.EDU:dill@amadeus.Stanford.EDU Systems students?
C01424 00268 ∂15-Feb-90 1136 LOGMTC-mailer Mints seminar series
C01426 00269 ∂15-Feb-90 1331 mrg@Sunburn.Stanford.EDU parking
C01428 00270 ∂15-Feb-90 1426 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 20 February, 7:30
C01435 00271 ∂15-Feb-90 1459 helen@russell.Stanford.EDU Internship lunch
C01438 00272 ∂15-Feb-90 1508 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU summary of replies to Data Structures and Algorithms text request
C01445 00273 ∂15-Feb-90 1543 LOGMTC-mailer tuesday seminar
C01449 00274 ∂16-Feb-90 1154 peters@russell.Stanford.EDU Re: Internship lunch
C01451 00275 ∂16-Feb-90 1215 LOGMTC-mailer MSRI Seminar Announcements, Feb 19-23
C01455 00276 ∂16-Feb-90 1458 davis@Sunburn.Stanford.EDU
C01456 00277 ∂16-Feb-90 1507 davis@Sunburn.Stanford.EDU Graphics Gathering Saturday
C01458 00278 ∂16-Feb-90 1619 grundy@csli.Stanford.EDU Symbolic Systems Forum
C01461 00279 ∂16-Feb-90 2121 grundy@csli.Stanford.EDU Symbolic Systems Forum
C01464 00280 ∂18-Feb-90 2220 jones@Sunburn.Stanford.EDU white boards in sitn lecture hall?
C01466 00281 ∂19-Feb-90 2038 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU This week's seminar
C01470 00282 ∂19-Feb-90 2212 LOGMTC-mailer tuesday seminar reminder
C01472 00283 ∂20-Feb-90 1018 eisensee@sierra.Stanford.EDU Solid State Seminar
C01474 00284 ∂20-Feb-90 1106 chandler@Sunburn.Stanford.EDU Today's faculty lunch
C01476 00285 ∂20-Feb-90 1146 chandler@Sunburn.Stanford.EDU CSD Retreat
C01478 00286 ∂20-Feb-90 1430 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Time to set dates for 1991
C01481 00287 ∂20-Feb-90 1617 chandler@Sunburn.Stanford.EDU Publication
C01483 00288 ∂20-Feb-90 1617 chandler@Sunburn.Stanford.EDU Publication
C01485 00289 ∂20-Feb-90 1818 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Publication
C01487 00290 ∂20-Feb-90 1818 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Publication
C01489 00291 ∂21-Feb-90 0836 hemenway@Sunburn.Stanford.EDU Round 2 Schedule
C01494 00292 ∂21-Feb-90 0845 bergman@Sunburn.Stanford.EDU funding announcement
C01496 00293 ∂21-Feb-90 1152 helen@russell.Stanford.EDU Courses and Degrees
C01499 00294 ∂21-Feb-90 1251 @RELAY.CS.NET:mazzetti@ed.aaai.org Prize award issue
C01502 00295 ∂21-Feb-90 1412 LOGMTC-mailer seminar
C01504 00296 ∂21-Feb-90 1535 ingrid@russell.Stanford.EDU CSLI Calendar, 22 February, vol. 5:18
C01524 00297 ∂21-Feb-90 1710 fisher@Sunburn.Stanford.EDU old computers
C01526 00298 ∂21-Feb-90 1746 marty@cis.Stanford.EDU Prize award issue
C01529 00299 ∂22-Feb-90 1020 LOGMTC-mailer Mints seminar series
C01531 00300 ∂22-Feb-90 1308 turner@sierra.Stanford.EDU Time Schedules Spring 89-90
C01533 00301 ∂22-Feb-90 1912 @RELAY.CS.NET:mazzetti@ed.aaai.org
C01537 00302 ∂22-Feb-90 2022 LOGMTC-mailer seminar
C01540 00303 ∂22-Feb-90 2111 LOGMTC-mailer Mints seminar series
C01542 00304 ∂22-Feb-90 2129 marty@cis.Stanford.EDU
C01545 00305 ∂22-Feb-90 2147 forbus@cs.uiuc.edu Foo on awards
C01548 00306 ∂23-Feb-90 0502 rgsmith@SLCS.SLB.COM prize paper award
C01551 00307 ∂23-Feb-90 0823 LOGMTC-mailer tuesday seminar
C01555 00308 ∂23-Feb-90 1053 turner@sierra.Stanford.EDU Spring Qtr Exam Change
C01557 00309 ∂23-Feb-90 1112 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parcella '90 call for papers
C01569 00310 ∂23-Feb-90 1121 reis@cis.Stanford.EDU An Unusual High Noon Talk
C01573 00311 ∂23-Feb-90 1357 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parcella '90 call for papers
C01585 00312 ∂23-Feb-90 1417 Clancey.pa@Xerox.COM International String Competition Benefit Concert
C01589 00313 ∂25-Feb-90 1429 @Sunburn.Stanford.EDU:dill@hohum.Stanford.EDU batch 2 of admissions folders
C01591 00314 ∂26-Feb-90 0903 peters@russell.Stanford.EDU Meeting of researchers and staff on March 15
C01594 00315 ∂26-Feb-90 1007 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Gene Golub to NAE
C01596 00316 ∂26-Feb-90 1115 bergman@Sunburn.Stanford.EDU funding announcements
C01600 00317 ∂26-Feb-90 1122 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Int'l Conf. on Database Theory - Call for Papers
C01607 00318 ∂26-Feb-90 1127 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ICALP'90 Advance Programme
C01625 00319 ∂26-Feb-90 1147 sloan@Sunburn.Stanford.EDU Fire Alarm Test
C01626 00320 ∂26-Feb-90 1418 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parcella '90 call for papers
C01638 00321 ∂26-Feb-90 1429 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
C01640 00322 ∂26-Feb-90 1435 chandler@Sunburn.Stanford.EDU David Williams
C01641 00323 ∂26-Feb-90 1516 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU The 15th Theory Day at Columbia University
C01645 00324 ∂26-Feb-90 1622 chandler@Sunburn.Stanford.EDU Publication
C01647 00325 ∂26-Feb-90 1730 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for Papers Advances in Logic Programming and Automated
C01652 00326 ∂26-Feb-90 1957 LOGMTC-mailer seminar
C01654 00327 ∂27-Feb-90 0944 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU This week's talk
C01656 00328 ∂27-Feb-90 1030 grundy@csli.Stanford.EDU Symbolic Systems Forum
C01659 00329 ∂27-Feb-90 1159 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU Abstract for this week's talk
C01661 00330 ∂27-Feb-90 1303 LOGMTC-mailer Mints seminar series -- reminder
C01662 00331 ∂27-Feb-90 1424 chandler@Sunburn.Stanford.EDU test
C01667 00332 ∂27-Feb-90 1505 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Folk Theorem: NC↑1 and EREW PRAMs
C01672 00333 ∂27-Feb-90 1629 hemenway@Sunburn.Stanford.EDU Change in Sunday Meeting Time
C01674 00334 ∂27-Feb-90 1645 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU IBM nominations for fellowships -- CSD students only
C01677 00335 ∂27-Feb-90 1705 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: IBM nominations for fellowships -- CSD students only
C01679 00336 ∂28-Feb-90 0737 chandler@Sunburn.Stanford.EDU Yet another pub....
C01681 00337 ∂28-Feb-90 0900 stager@Sunburn.Stanford.EDU Fall Quarter Tau Beta Pi Survey Results
C01683 00338 ∂28-Feb-90 1143 robertso@sierra.Stanford.EDU Majors Event, April 18 (From: G. Franklin)
C01685 00339 ∂28-Feb-90 1334 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU expansion
C01687 00340 ∂28-Feb-90 1405 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Forum sets record
C01689 00341 ∂28-Feb-90 1410 kirsten@isl.Stanford.EDU EE 370 Seminar - MATLAB
C01691 00342 ∂28-Feb-90 1504 ingrid@russell.Stanford.EDU Talk by Daniel Lehmann, Thursday, 1 March, 10:30 a.m.
C01695 00343 ∂28-Feb-90 1513 ingrid@russell.Stanford.EDU CSLI Calendar, 1 March, vol. 5:19
C01705 00344 ∂28-Feb-90 1647 DAVIES@Warbucks.AI.SRI.COM plλλPLANLUNCH RETURNS! -- MARCH 7 -- WEDNESDAY -- Martha Pollack
C01709 00345 ∂01-Mar-90 0933 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU lower bound for FSA language inclusion...
C01712 00346 ∂01-Mar-90 0933 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Looking for roommate during DMCC5 at Charleston, SC, April 9-12
C01715 00347 ∂01-Mar-90 0941 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU partition into isomorphic subgraphs
C01718 00348 ∂01-Mar-90 0946 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Job Openings at Bell Labs
C01722 00349 ∂01-Mar-90 0949 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU TCS Olympiad
C01727 00350 ∂01-Mar-90 0959 stager@Sunburn.Stanford.EDU Courses and Degrees
C01729 00351 ∂01-Mar-90 1116 hemenway@Sunburn.Stanford.EDU Peterson's Guide
C01731 00352 ∂01-Mar-90 1227 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary of responses: EREW PRAMs vs NC↑1
C01735 00353 ∂01-Mar-90 1317 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
C01739 00354 ∂01-Mar-90 1334 csl@sierra.Stanford.EDU Computer Systems Laboratory Special Seminar
C01744 00355 ∂01-Mar-90 1343 hall@cis.Stanford.EDU SPECIAL SEMINAR
C01748 00356 ∂01-Mar-90 1413 chandler@Sunburn.Stanford.EDU Publication
C01750 00357 ∂01-Mar-90 1525 hemenway@Sunburn.Stanford.EDU Meeting will be at 1:00 pm
C01752 00358 ∂01-Mar-90 1832 grundy@csli.Stanford.EDU Symbolic Systems Forum
C01756 00359 ∂01-Mar-90 2018 LOGMTC-mailer Parikh talk on knowledge
C01758 00360 ∂02-Mar-90 0002 LOGMTC-mailer tuesday seminar
C01761 00361 ∂02-Mar-90 0924 hemenway@Sunburn.Stanford.EDU IMPORTANT -- Getting Ratings to Me
C01764 00362 ∂02-Mar-90 1053 kirsten@isl.Stanford.EDU EE 370 Seminar
C01767 00363 ∂02-Mar-90 1220 LOGMTC-mailer Mints seminar series
C01769 00364 ∂02-Mar-90 1329 chandler@Sunburn.Stanford.EDU Next Tuesday's Faculty Lunch
C01771 00365 ∂02-Mar-90 1447 eisensee@sierra.Stanford.EDU Courses and Degrees
C01772 00366 ∂03-Mar-90 1122 LOGMTC-mailer Logic/Database Talk
C01773 00367 ∂03-Mar-90 1314 LOGMTC-mailer special seminar
C01775 00368 ∂05-Mar-90 0642 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Reductions from problems to MIS, VC or Max. clique (info request)
C01779 00369 ∂05-Mar-90 0647 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Hamiltonian circuits in complements of line graphs
C01782 00370 ∂05-Mar-90 0647 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU geometry problem
C01785 00371 ∂05-Mar-90 0900 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report column, Feb. 28,
C01788 00372 ∂05-Mar-90 0922 LOGMTC-mailer Lectures on Linear Logic
C01790 00373 ∂05-Mar-90 0952 hemenway@Sunburn.Stanford.EDU Final List Confirmation
C01797 00374 ∂05-Mar-90 1116 @Sunburn.Stanford.EDU:nowick@Neon.Stanford.EDU Re: Final List Confirmation
C01799 00375 ∂05-Mar-90 1133 @Sunburn.Stanford.EDU:RPG@SAIL.Stanford.EDU re: Final List Confirmation
C01801 00376 ∂05-Mar-90 1143 @RELAY.CS.NET:mazzetti@ed.aaai.org video
C01804 00377 ∂05-Mar-90 1301 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU AFLB this week
C01808 00378 ∂05-Mar-90 1330 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: Final List Confirmation
C01813 00379 ∂05-Mar-90 1407 @Sunburn.Stanford.EDU:dill@amadeus.Stanford.EDU Hoang
C01815 00380 ∂05-Mar-90 1413 hemenway@Sunburn.Stanford.EDU Re: Hoang
C01817 00381 ∂05-Mar-90 1521 LOGMTC-mailer Re: MSRI Seminar Announcements, Feb 19-23
C01819 00382 ∂05-Mar-90 1601 @Sunburn.Stanford.EDU:mad@mambo.Stanford.EDU My Hoang
C01825 00383 ∂05-Mar-90 1628 @Sunburn.Stanford.EDU:RPG@SAIL.Stanford.EDU re: My Hoang
C01828 00384 ∂05-Mar-90 2235 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU re: My Hoang
C01831 00385 ∂05-Mar-90 2257 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: My Hoang
C01839 00386 ∂06-Mar-90 0206 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Hoang
C01843 00387 ∂06-Mar-90 0816 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: Hoang
C01845 00388 ∂06-Mar-90 0831 stager@Sunburn.Stanford.EDU Spring Quarter TA Interviews
C01847 00389 ∂06-Mar-90 0850 LOGMTC-mailer MSRI Seminar Announcements, Feb 19-23
C01849 00390 ∂06-Mar-90 0958 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Hoang
C01852 00391 ∂06-Mar-90 1005 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
C01856 00392 ∂06-Mar-90 1006 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Strict deterministic propositional dynamic logic
C01860 00393 ∂06-Mar-90 1007 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: geometry problem
C01870 00394 ∂06-Mar-90 1021 hall@cis.Stanford.EDU SPECIAL Seminar 3/12
C01874 00395 ∂06-Mar-90 1027 @Sunburn.Stanford.EDU:dill@amadeus.Stanford.EDU Hoang
C01876 00396 ∂06-Mar-90 1031 @Sunburn.Stanford.EDU:RPG@SAIL.Stanford.EDU re: My Hoang
C01879 00397 ∂06-Mar-90 1038 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu procedure
C01881 00398 ∂06-Mar-90 1040 carlstea@sierra.Stanford.EDU Taylor and Francis Publishers
C01883 00399 ∂06-Mar-90 1104 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Hoang
C01885 00400 ∂07-Mar-90 1454 ingrid@russell.Stanford.EDU CSLI Calendar, 8 March, vol. 5:20
C01896 00401 ∂07-Mar-90 1525 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Simulations of Automata, grammars,...
C01899 00402 ∂07-Mar-90 1644 kirsten@isl.Stanford.EDU EE 370 Seminar
C01902 00403 ∂08-Mar-90 0909 LOGMTC-mailer Parikh talk
C01903 00404 ∂08-Mar-90 1117 stager@Sunburn.Stanford.EDU Spring Quarter Course Evaluations
C01907 00405 ∂08-Mar-90 1140 LOGMTC-mailer seminar
C01911 00406 ∂08-Mar-90 1141 LOGMTC-mailer tuesday seminar
C01914 00407 ∂08-Mar-90 1456 LOGMTC-mailer Logic/Database Talk (change of time!)
C01916 00408 ∂08-Mar-90 1737 BRACEWELL@STAR2.STANFORD.EDU Executive Committee System
C01921 00409 ∂09-Mar-90 0823 chandler@Sunburn.Stanford.EDU Faculty Lunch
C01923 00410 ∂09-Mar-90 1309 turner@sierra.Stanford.EDU Tau Beta Pi
C01924 00411 ∂09-Mar-90 1434 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU academic senate
C01926 00412 ∂09-Mar-90 1551 @Sunburn.Stanford.EDU,@Score.Stanford.EDU:eaf@sumex-aim.stanford.edu response to Nils' query
C01928 00413 ∂09-Mar-90 1616 DAVIES@Warbucks.AI.SRI.COM PLANLUNCH -- David Einav -- MArMarch 14 -- Wednesday
C01933 00414 ∂11-Mar-90 0312 LOGMTC-mailer tuesday seminar
C01935 00415 ∂11-Mar-90 1007 @Sunburn.Stanford.EDU:golub@patience.Stanford.EDU whiteboards
C01938 00416 ∂11-Mar-90 1306 @Sunburn.Stanford.EDU:JMC@SAIL.Stanford.EDU re: whiteboards
C01940 00417 ∂12-Mar-90 0737 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Questions on BNF.
C01943 00418 ∂12-Mar-90 0830 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: events mail
C01946 00419 ∂12-Mar-90 0834 emma@russell.Stanford.EDU Reminder
C01949 00420 ∂12-Mar-90 0844 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Triangulation of Simple Polygons
C01953 00421 ∂12-Mar-90 0845 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Second Canandian Conference on Computational Geometry
C01958 00422 ∂12-Mar-90 0846 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Third International Workshop on Artificial Intelligence and
C01965 00423 ∂12-Mar-90 0848 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Questions on BNF.
C01968 00424 ∂12-Mar-90 0927 wheaton@Sunburn.Stanford.EDU candidates for Assistant Chair for Education
C01970 00425 ∂12-Mar-90 0933 abbas@isl.Stanford.EDU Demos of EE218
C01971 00426 ∂12-Mar-90 1005 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU retreat
C01975 00427 ∂12-Mar-90 1012 gerlach@sierra.Stanford.EDU Tau Beta Pi surveys
C01977 00428 ∂12-Mar-90 1219 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU Last talk of the quarter
C01980 00429 ∂12-Mar-90 1221 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU more on TBPs
C01982 00430 ∂12-Mar-90 1226 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU more on TBPs
C01984 00431 ∂12-Mar-90 1309 @Sunburn.Stanford.EDU:bthomas@Neon.Stanford.EDU CS523
C01986 00432 ∂12-Mar-90 1339 jones@Sunburn.Stanford.EDU Clarification of Senior Project Requirement
C01994 00433 ∂12-Mar-90 1406 @Sunburn.Stanford.EDU:jcm@Iswim.Stanford.EDU Re: My Hoang
C01996 00434 ∂12-Mar-90 2059 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU polynomials - a summary of replies
C02008 00435 ∂12-Mar-90 2100 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Solution of a filters system ?
C02012 00436 ∂12-Mar-90 2103 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Algorithmica Special Issue on On-line Algorithms
C02017 00437 ∂12-Mar-90 2141 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU corrected version of Computational Geometry Day
C02024 00438 ∂13-Mar-90 1002 stager@Sunburn.Stanford.EDU Autumn Quarter Tau Beta Pi
C02026 00439 ∂13-Mar-90 1032 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU discussion today
C02029 00440 ∂13-Mar-90 1122 chandler@Sunburn.Stanford.EDU Calendar Advisory
C02031 00441 ∂13-Mar-90 1504 ingrid@russell.Stanford.EDU Work/Design Seminar and Linguistics Colloquium this Week
C02036 00442 ∂13-Mar-90 1549 DAVIES@Warbucks.AI.SRI.COM REMINDER -- PLANLUNCH WEDNESDAY 11:00 (TOMORROW) -- DAVID EINAV
C02038 00443 ∂13-Mar-90 1624 ingrid@russell.Stanford.EDU Fourth Workshop on Unification
C02056 00444 ∂14-Mar-90 1352 goossens@bbc.Stanford.EDU ***** SEMINAR *****
C02058 00445 ∂14-Mar-90 1536 goossens@bbc.Stanford.EDU ***** SEMINAR *****
C02060 00446 ∂14-Mar-90 1618 stager@Sunburn.Stanford.EDU Winter Quarter Grade Sheets
C02062 00447 ∂14-Mar-90 1840 hellman@isl.Stanford.EDU "Star" Admit Meetings
C02064 00448 ∂15-Mar-90 0918 chandler@Sunburn.Stanford.EDU ONR Publication
C02066 00449 ∂15-Mar-90 1116 @Sunburn.Stanford.EDU:winograd@loire.stanford.edu EXPERIMENTAL NEW COURSE - CS247 HUMAN-COMPUTER INTERACTION
C02070 00450 ∂15-Mar-90 1240 @Sunburn.Stanford.EDU:shoham@Hudson.Stanford.EDU PC loner
C02072 00451 ∂15-Mar-90 1353 wheaton@Sunburn.Stanford.EDU PC loner
C02074 00452 ∂15-Mar-90 1508 chandler@Sunburn.Stanford.EDU Spring Quarter Faculty Lunches
C02076 00453 ∂15-Mar-90 1810 @Sunburn.Stanford.EDU:winograd@loire.stanford.edu CORRECTION to CS247 ANNOUNCEMENT - TIME IS Monday and Wed, 2:15-3:30
C02078 00454 ∂16-Mar-90 0737 @Sunburn.Stanford.EDU:NA.PHL@Forsythe.Stanford.EDU
C02081 00455 ∂16-Mar-90 0756 chandler@Sunburn.Stanford.EDU Next Tuesday's faculty lunch
C02083 ENDMK
C⊗;
∂03-Jan-90 0626 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SODA deadline
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 06:26:07 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13323; Wed, 3 Jan 90 06:25:36 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04116; Wed, 3 Jan 90 06:21:04 -0800
Message-Id: <9001031421.AA04116@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9357; Wed, 03 Jan 90 08:23:36 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9344; Wed, 03 Jan 90 08:23:33 CST
Date: Wed, 3 Jan 90 08:21:29 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
dsj@research.att.com
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: dsj%research.att.com@VM1.NoDak.EDU
Subject: SODA deadline
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The deadline for receipt of registration forms for the first
ACM SIAM Symposium on Discrete Algorithms (SODA) is January 8.
After that, the fees go up by $50. Here is a reposting of
the registration and hotel reservation forms:
First ACM-SIAM Symposium on
Discrete Algorithms
Hotel Reservation Form
Please send me a Confirmation
Specially discounted rooms are being held for our
exclusive use until December 31, 1989. After that
date, reservations will depend on availability. Your
reservation is not confirmed until acknowledged in
writing by the hotel or verified by phone. When making
reservations by phone, be sure to identify yourself as
an attendee at the First ACM-SIAM Symposium on Discrete
Algorithms. Telephone: 1-415-776-8200.
Please Print
Name______________________________________________
Phone_____________________________________________
Address___________________________________________
City______________________________________________
State_____ Zip______ Country______________________
Please Reserve: [ ] Single ($77) [ ] Double ($97)
Arrival Date_____________ Arrival Time____________
Check-out Date______________
Guarantee my room for late arrival (after 6:00 pm)
[ ] Yes [ ] No
(Requires one night's deposit by check or credit card)
I wish to pay by: [ ] AMEX [ ] VISA [ ] MasterCard
[ ] Check
Credit Card_______________________________________
Exp. Date_________________________________________
Deposit_______________________ (Late arrival only)
Signature_________________________________________
Mail this reservation form to:
Reservations
The Cathedral Hill Hotel
Van Ness at Geary Street
San Francisco, CA 94109
***************************************************************
First ACM-SIAM Symposium on
Discrete Algorithms
Advance Registration Form
Registration Fees
ACM-SIAM ACM-SIAM
Member Non-Member Student
Advance $235 $275 $50
On-Site $285 $325 $100
Symposium ______ ______ ______
Beer Party $16 ______ ______ ______
Total ______ ______ ______
Please Print
Name______________________________________________
Affiliation_______________________________________
Department________________________________________
Address___________________________________________
City______________________________________________
State_____ Zip______ Country______________________
Telephone_________________________________________
Local Address in San Francisco____________________
__________________________________________________
I wish to pay by: [ ] AMEX [ ] VISA [ ] MasterCard
[ ] Check (payable to SIAM)
Credit Card_______________________________________
Exp. Date_________________________________________
Signature_________________________________________
[ ] Please send information about SIAM membership
Mail this registration form and payment to:
SIAM
3600 University City Science Center
Philadelphia, PA 19104-2688
Telephone: 215-382-9800.
Advance Registration Form must be received at the SIAM
office by January 8, 1990.
∂03-Jan-90 0646 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Bryant's algorithms
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 06:46:50 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13401; Wed, 3 Jan 90 06:46:27 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04374; Wed, 3 Jan 90 06:41:57 -0800
Message-Id: <9001031441.AA04374@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9411; Wed, 03 Jan 90 08:25:03 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9393; Wed, 03 Jan 90 08:24:14 CST
Date: Wed, 3 Jan 90 08:21:48 CST
Reply-To: Mats Carlsson <matsc%sics.se@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Mats Carlsson <matsc%sics.se@VM1.NoDak.EDU>
Subject: Bryant's algorithms
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I'm looking for an implementation of the algorithms described in the
reference below. If anyone has such an implementation, preferably
ftp-able, please reply by e-mail or post. Thanks.
R. E. Bryant, "Graph Based Algorithms for Boolean Function
Manipulation", IEEE Transactions on Computers, Vol. C-35, No. 8
(August 1986) pp. 677-691.
--
Mats Carlsson
SICS, PO Box 1263, S-164 28 KISTA, Sweden Internet: matsc@sics.se
Tel: +46 8 7521543 Ttx: 812 61 54 SICS S Fax: +46 8 7517230
∂03-Jan-90 0647 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU polynomial interpolation
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 06:47:39 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13411; Wed, 3 Jan 90 06:47:25 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04377; Wed, 3 Jan 90 06:42:43 -0800
Message-Id: <9001031442.AA04377@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9465; Wed, 03 Jan 90 08:25:33 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9445; Wed, 03 Jan 90 08:24:49 CST
Date: Wed, 3 Jan 90 08:22:03 CST
Reply-To: Richard Beigel <beigel-richard%YALE.ARPA@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Richard Beigel <beigel-richard%YALE.ARPA@VM1.NoDak.EDU>
Subject: polynomial interpolation
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am looking for theorems along the following lines:
(a) If p(x) is a dth degree polynomial and |p(x)| < 1 for
1 <= x <= m where m is much larger than d then all the coefficients
of p are very small.
(b) If p(x) is a dth degree polynomial and |p(i)| < 1 for
i = 1,2,...,m where m is much larger than d then all the coefficients
of p are very small.
(c) If p(x) is a dth degree polynomial and |p(i)| < 1 for
i = 1,2,...,m where m is much larger than d then
|p(x)| < 2 for 1 <= x <= m.
I have some results but I suspect that this problem has already been
studied. I would appreciate any leads. Thanks.
-- Richard Beigel
∂03-Jan-90 0651 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Job Announcement
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 06:51:00 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13450; Wed, 3 Jan 90 06:50:47 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04389; Wed, 3 Jan 90 06:43:40 -0800
Message-Id: <9001031443.AA04389@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9520; Wed, 03 Jan 90 08:27:10 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9503; Wed, 03 Jan 90 08:25:09 CST
Date: Wed, 3 Jan 90 08:22:24 CST
Reply-To: Darrah Chavey <chavey%cs.wisc.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Darrah Chavey <chavey%cs.wisc.edu@VM1.NoDak.EDU>
Subject: Job Announcement
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
ANNOUNCEMENT OF VACANCY December, 1989
Department of Mathematics and Computer Science at Beloit College announces
a tenure track position to start in August 1990. Applications are invited.
Rank: Assistant or Associate Professor.
Salary: Open, depending upon experience.
Duties: Teaching undergraduate mathematics and computer science courses,
three courses (an average of 11 hours) per semester. Academic advising.
Participation in departmental activities and colloquium. Possibility of
teaching interdisciplinary courses.
Qualifications: Ph.D. in a mathematical science. Ability to teach some
upper level computer science and/or statistics courses. Strong interest in
undergraduate liberal arts education. Dedication to excellence in teaching
and continued professional growth. Computer science and/or statistics should
be one area of professional interest.
Fringe benefits: Group life, medical and long-term disability insurance.
TIAA-CREF retirement program. The college has funds available for
professional travel and development and a sabbatical leave program. The
college operates an on-campus center for infant and child care.
Application procedures: Candidates should apply by letter with resume,
indicating interests and describing background in mathematics, computer
science and statistics. Each candidate should arrange to have forwarded:
(1) at least three letters of reference from persons qualified to assess
the candidate's teaching ability and potential for professional growth, and
(2) transcripts of graduate and (if possible) undergraduate work.
Application deadline: February 1, 1990, for assured consideration.
Additional information: Beloit College is an independent four-year non-
sectarian liberal arts college, chartered in 1846. The City of Beloit
(Wisconsin) has a population of 35,000 and is located within easy driving
distance of Madison, Milwaukee and Chicago. The college operates on a two-
semester calendar. The coeducational student body of 1100 is drawn from 40
states and two dozen foreign countries. The Department of Mathematics and
Computer Science has a full-time staff of six, graduates ten to twenty majors
per year, and teaches 600 students per year. The UMAP Journal is edited at
the college.
Address correspondence to: Phil Straffin
Chair, Mathematics and Computer Science
608/365-3391, extension 367
BELOIT COLLEGE IS AN EQUAL OPPORTUNITY AND AFFIRMATIVE ACTION EMPLOYER.
∂03-Jan-90 1024 bates@sierra.STANFORD.EDU Course Announcement
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 10:24:45 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Wed, 3 Jan 90 10:21:20 PST
Date: Wed, 3 Jan 90 10:21:20 PST
From: bates@sierra.STANFORD.EDU (Clayton W. Bates)
To: ee-faculty@sierra
Cc: cis-people@glacier
Subject: Course Announcement
Message-Id: <CMM.0.88.631390879.bates@>
EE337 Solid-State Characterization Laboratory(Winter Quarter 1990)
Instructor: C.W.Bates, Jr.
∂03-Jan-90 1035 bates@sierra.STANFORD.EDU Course Announcement
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 10:35:45 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Wed, 3 Jan 90 10:31:45 PST
Date: Wed, 3 Jan 90 10:31:45 PST
From: bates@sierra.STANFORD.EDU (Clayton W. Bates)
To: ee-faculty@sierra
Cc: cis-people@glacier
Subject: Course Announcement
Message-Id: <CMM.0.88.631391501.bates@>
EE337 SOLID-STATE CHARACTERIZATION LABORATORY(Winter Quarter1990)
Instructor: Prof. C.W.Bates,Jr.
Peterson 550J
Ext.3-4252
Credit: 3 Units
Hours: To be arranged
The first class meeting for winter quarter1990 will be held Wednesday, Jan.17
@ 2:15pm in Peterson 550C.
∂03-Jan-90 1058 bates@sierra.STANFORD.EDU previous message
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 10:58:01 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Wed, 3 Jan 90 10:54:17 PST
Date: Wed, 3 Jan 90 10:54:17 PST
From: bates@sierra.STANFORD.EDU (Clayton W. Bates)
To: ee-faculty@sierra
Cc: cis-people@glacier
Subject: previous message
Message-Id: <CMM.0.88.631392853.bates@>
Please forgive the screwup on the previously sent message.I wanted simply to
announce that the first meeting of EE337 Solid-State Characterization Lab
will be held on Wednesday, January 17 @ 2:15pm in Peterson 550C for the
winter quarter.
Clay Bates
∂03-Jan-90 1118 betsy@russell.Stanford.EDU NIH Grant Application Workshop
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Jan 90 11:18:14 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA14868; Wed, 3 Jan 90 11:20:06 PST
Date: Wed 3 Jan 90 11:20:05-PST
From: Betsy Macken <BETSY@CSLI.Stanford.EDU>
Subject: NIH Grant Application Workshop
To: faculty@russell.Stanford.EDU
Cc: ingrid@russell.Stanford.EDU
Message-Id: <631394405.0.BETSY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
Here's something that may be of interest to you; Ingrid and I will
be attending.
Betsy
`` Grant Applications to the NIH ''
A Sponsored Projects Office Workshop to help guide you through:
* The PHS 398 Application Form
* Budget preparation and NIH's new salary cap
* Compliance Issues: Human and Animal Subjects
* The 2590 Continuation Application
* Hard Times at NIH-SPO Resources
DATE: Thursday, January 18, 1990
TIME: 1:00 to 3:30 PM
PLACE: Fairchild Auditorium
To register: Please phone 5-0518 by Jan. 12
-------
∂03-Jan-90 1931 LOGMTC-mailer POPL visitors
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
During the weeks surrounding POPL (Jan 17-19) we will have
several visitors. Below is a list of visitors, approximate
duration of visit, and topic of seminar. Exact seminar
times, titles, and abstracts will be posted later.
Timothy Griffin (IMECC-UNICAMP, Brazil) Jan 9-22 minus POPL
A formulas as types correspondence between lambda calculus extended by
control abstractions and classical proofs.
Charles Consel (Yale University) Jan 15-16
About a self-applicable partial evaluator that handles both
higher order abstraction and data structures.
Matthias Felleisen (Rice University) Jan 20-22
About a formal expressiveness relation on programming languages
that seems to capture intuitive understanding, including the idea
that programs in a more expressive language tend to be shorter than
equivalent programs in less expressive languages.
∂04-Jan-90 0715 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Average running time of a simple algorithm
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 07:15:49 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25442; Thu, 4 Jan 90 07:15:17 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27286; Thu, 4 Jan 90 07:15:13 -0800
Message-Id: <9001041515.AA27286@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2350; Thu, 04 Jan 90 09:12:18 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2329; Thu, 04 Jan 90 09:12:16 CST
Date: Thu, 4 Jan 90 09:10:45 CST
Reply-To: Michael Kolountzakis <kolount%gauss.stanford.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Michael Kolountzakis <kolount%gauss.stanford.edu@VM1.NoDak.EDU>
Subject: Average running time of a simple algorithm
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Hi, here is a question:
We have a vector f[1..n] and we fill it like this:
f[1]=0 and f[i] = f[i-1]+-1 with equal probability.
We have the following simple algorithm for finding max{f[i], i=1..n}.
We have a variable M, initially 0, and we increment it until it becomes
the required value as follows: a pointer starts at 0 and moves to the right
as much as it can, that is M-f[current position]+1. It then updates M if
necessary (that is when f[new-current-position]>M). The algorithm is over
when the pointer passes the end of the vector. This is a simple algorithm.
Another version of it could be to split the vector into k equal pieces, i.e.
from 1 to n/k, from n/k+1 to 2*n/k, etc, and use the previous algorithm on
these pieces simultaneously. That is, we have ONE global variable which all
copies of the algorithm update.
If we want to compare these two versions (with k=1 and k>1, say 2) we
must of course decrease the speed of the pointers to 1/k of the speed of
the single pointer (we distribute the time of our computer evenly, in other
words).
The strange thing is that my simulations show that the second version is (on
the average of course) much better than the first. This happens up to a certain
value of k.
Can anybody tell me if this is true, and if yes WHY?
Michael Kolountzakis
kolount@gauss.stanford.edu
∂04-Jan-90 1132 @Polya.Stanford.EDU:hemenway@Sunburn.Stanford.EDU Calendar Advisory
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 11:32:35 PST
Received: from Sunburn.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01258; Thu, 4 Jan 90 11:32:28 -0800
Received: by Sunburn.Stanford.EDU (5.61/25-eef) id AA14043; Thu, 4 Jan 90 11:32:39 -0800
Date: Thu, 4 Jan 1990 11:32:37 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Calendar Advisory
Message-Id: <CMM.0.88.631481557.hemenway@Sunburn.Stanford.EDU>
Although we are just now beginning to get the bulk of the applications
and have yet even to discuss the date of our first meeting, I thought
I would send out this message to alert those of you shown to be on the
PhD Admissions committee this year when you might expect to be
surrounded by application folders! The calendar we have followed for
the past few years seems to have worked well so I am assuming we will
be following a similar time table. That means that our first meeting
will be sometime around Feb. 1; Round 1 readings will occupy the first
2 1/2 weeks of February, followed by the Round 1 meeting; Round 2
readings will follow, culminating in the final decision meeting around
March 8.
These five weeks are quite busy and do require a fairly sizable time
commitment. Thus, if you know now that you will need to be out of town
for a large chunk of time or will have other urgent commitments,
please let either me or Mike Genesereth know. If you could arrange or
suggest a substitute, that would be much appreciated.
I will be back in touch soon with the date of our first meeting. By
the way, this is who I think is on this year's committee (based on
Nils' committee message). Please let me know if you don't think
you're on it or know of others who might be.
Mike Genesereth, Chair
David Dill
Richard Gabriel
Oussama Khatib
John Koza
John McCarthy
John Mitchell
Vaughan Pratt
Yoav Shoham
Marcia Derr
Steve Nowick
Ken Ross
Thanks--
Sharon
∂04-Jan-90 1210 @Polya.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu distribution
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 12:10:41 PST
Received: from Coraki.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01879; Thu, 4 Jan 90 12:10:24 -0800
Received: by coraki.stanford.edu (4.1/25-eef) id AA08525; Thu, 4 Jan 90 12:11:26 PST
Message-Id: <9001042011.AA08525@coraki.stanford.edu>
To: phd-adm@coraki.stanford.edu
Subject: distribution
Date: 04 Jan 90 12:11:25 PST (Thu)
From: pratt@cs.Stanford.EDU
I'm glad to see the programming languages area is well represented on
our committee. We cover Lisp (McCarthy), Common Lisp & Q-Lisp
(Gabriel), types (Mitchell), and concurrent programming (Pratt, Dill).
I'm happy to wear my algorithms hat for this committee. We need
volunteers to stick up for scientific computing and systems.
-v
∂04-Jan-90 1214 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU logarithms of algebraic numbers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 12:14:01 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA10843; Thu, 4 Jan 90 12:09:13 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01827; Thu, 4 Jan 90 12:08:33 -0800
Message-Id: <9001042008.AA01827@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5292; Thu, 04 Jan 90 14:07:05 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5276; Thu, 04 Jan 90 14:07:02 CST
Date: Thu, 4 Jan 90 14:06:22 CST
Reply-To: Bruce E Litow <litow%csd4.csd.uwm.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Bruce E Litow <litow%csd4.csd.uwm.edu@VM1.NoDak.EDU>
Subject: logarithms of algebraic numbers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Given algebraic numbers a_1exp(2*i*pi*b_1),...,a_rexp(2*i*pi*b_r)
where the a_j and the b_j are all real is it decidable to
determine whether or not b_1,...,b_r are linearly independent over the
rationals ?
∂04-Jan-90 1233 @Polya.Stanford.EDU,@coraki.stanford.edu,@Polya.Stanford.EDU:jcm@iswim.Stanford.EDU Re: distribution
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 12:33:11 PST
Received: from Coraki.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02358; Thu, 4 Jan 90 12:33:04 -0800
Received: from Polya.Stanford.EDU by coraki.stanford.edu (4.1/25-eef) id AA08725; Thu, 4 Jan 90 12:34:05 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02354; Thu, 4 Jan 90 12:32:56 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA11452; Thu, 4 Jan 90 12:21:40 PST
Message-Id: <9001042021.AA11452@iswim.stanford.EDU>
To: phd-adm@coraki.stanford.edu
Subject: Re: distribution
In-Reply-To: Your message of Thu, 04 Jan 90 12:11:25 -0800.
<9001042011.AA08525@coraki.stanford.edu>
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Thu, 04 Jan 90 12:21:39 PST
Sender: jcm@iswim.Stanford.EDU
I agree with Vaughan that the committee doesn't seem
to represent the balance of the department very well,
but I am willing to try. If it makes a difference, I
could trade committees with Motwani, say.
John
∂04-Jan-90 1247 @Polya.Stanford.EDU,@coraki.stanford.edu:RPG@SAIL.Stanford.EDU re: distribution
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 12:47:21 PST
Received: from Coraki.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02599; Thu, 4 Jan 90 12:47:11 -0800
Received: from SAIL.Stanford.EDU by coraki.stanford.edu (4.1/25-eef) id AA08854; Thu, 4 Jan 90 12:48:11 PST
Message-Id: <1OUwtL@SAIL.Stanford.EDU>
Date: 04 Jan 90 1246 PST
From: Dick Gabriel <RPG@SAIL.Stanford.EDU>
Subject: re: distribution
To: jcm@CS.Stanford.EDU, phd-adm@CORAKI.STANFORD.EDU
[In reply to message from jcm@cs.Stanford.EDU sent Thu, 04 Jan 90 12:21:39 PST.]
Passing up the opportunity to rag Vaughan for caricaturing both McCarthy's
and my research, I would venture it is up to the committee chairman to create
a balanced committee and not up to us.
-rpg-
∂04-Jan-90 1252 LOGMTC-mailer POPL visitors -- update
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
This list of visitors grows! In order to avoid too many conflicts we
have set times for known visitors to Stanford (see below).
Details (title, place, abstract, ...) will be announced at appropriate times.
Tim Griffin, Thursday Jan 11, 4pm -- seminar on control abstractions/classical proofs
Charles Consel, Tues Jan 16, 11am -- seminar on partial evaluation
Harry Mairson, Tues Jan 16, 4pm -- seminar on complexity of ML typing
Matthias Felleisen, Monday Jan 22, noon -- seminar on expressiveness
John Hughes, Mon Jan 22 at 4pm -- seminar on polymorphism and strictness analysis
Eugenio Moggi, Tues Jan 23, 4pm -- seminar on whatever he wants
∂04-Jan-90 1344 @Polya.Stanford.EDU:hemenway@Sunburn.Stanford.EDU ["Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU> : Calendar
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 13:42:51 PST
Received: from Sunburn.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03799; Thu, 4 Jan 90 13:42:30 -0800
Received: by Sunburn.Stanford.EDU (5.61/25-eef) id AA03422; Thu, 4 Jan 90 13:42:41 -0800
Date: Thu, 4 Jan 1990 13:42:39 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: ["Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU> : Calendar
Advisory ]
Message-Id: <CMM.0.88.631489359.hemenway@Sunburn.Stanford.EDU>
My apologies to those of you receiving this for the 2nd time but because
of some peculiarities in our mailing lists program, I've just discovered
that some of you didn't receive it at all. The problems should be
fixed now (I hope!).
Sharon
---------------
Date: Thu, 4 Jan 1990 11:32:37 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm
Subject: Calendar Advisory
Message-ID: <CMM.0.88.631481557.hemenway@Sunburn.Stanford.EDU>
Although we are just now beginning to get the bulk of the applications
and have yet even to discuss the date of our first meeting, I thought
I would send out this message to alert those of you shown to be on the
PhD Admissions committee this year when you might expect to be
surrounded by application folders! The calendar we have followed for
the past few years seems to have worked well so I am assuming we will
be following a similar time table. That means that our first meeting
will be sometime around Feb. 1; Round 1 readings will occupy the first
2 1/2 weeks of February, followed by the Round 1 meeting; Round 2
readings will follow, culminating in the final decision meeting around
March 8.
These five weeks are quite busy and do require a fairly sizable time
commitment. Thus, if you know now that you will need to be out of town
for a large chunk of time or will have other urgent commitments,
please let either me or Mike Genesereth know. If you could arrange or
suggest a substitute, that would be much appreciated.
I will be back in touch soon with the date of our first meeting. By
the way, this is who I think is on this year's committee (based on
Nils' committee message). Please let me know if you don't think
you're on it or know of others who might be.
Mike Genesereth, Chair
David Dill
Richard Gabriel
Oussama Khatib
John Koza
John McCarthy
John Mitchell
Vaughan Pratt
Yoav Shoham
Marcia Derr
Steve Nowick
Ken Ross
Thanks--
Sharon
∂04-Jan-90 1344 ingrid@russell.Stanford.EDU CSLI Calendar, 4 January 1990, vol. 5:11
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 13:42:42 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA21795; Thu, 4 Jan 90 13:10:05 PST
Date: Thu, 4 Jan 90 13:10:05 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001042110.AA21795@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 4 January 1990, vol. 5:11
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
4 January 1990 Stanford Vol. 5, No. 11
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 11 JANUARY 1990
12:00 noon TINLunch
Cordura 100 Reading: The Role of Infons in a Mathematical
Theory of Information, First Draft: January 1990
by Keith Devlin
Discussion led by Pat Hayes
(hayes.pa@xerox.com)
Abstract below
____________
ANNOUNCEMENT
CSLI Seminars will be scheduled irregularly during winter quarter;
watch the Calendar for announcements.
____________
NEXT WEEK'S TINLUNCH
Reading: The Role of Infons in a Mathematical Theory of Information
First Draft: January 1990
by Keith Devlin
Discussion led by Pat Hayes
While reading every introduction I can find to situation theory, I
have got stuck on the idea of an infon, and puzzled about which side
of the reference arrow it should be placed. It is a mistake, I
gather, to think of an infon as something like a proposition, or
perhaps even a sentence: something which is about the world. Rather,
I understand, an infon is actually part of the world, a piece of the
informational stuff out of which our universe is constructed. But if
this is so, what is a negative infon? All the introductions just take
this idea as obvious, but it worries me. Apart from the fact that
falsehoods clearly aren't in the world, even if we allow them there,
then -- as Quine once said about possible individuals -- there would
seem to have to be too many of them.
In recent netmail, Keith Devlin and I discussed this, and he used me
(with my permission) as a Simplicio in his recent paper. This
TINLunch is in part a presentation of his paper, and in part an
explanation of why I don't find his answers soothe my worries, and why
Simplicio believes that a simpler, less radical, notion of information
seems to offer a better account. The key is to put information in
representations, not in the world.
We will consider rectangles and tree-stumps, why the sea is boiling
hot, and whether pigs have wings.
∂04-Jan-90 1409 @Polya.Stanford.EDU,@coraki.stanford.edu:dill@amadeus.Stanford.EDU admissions committee
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 14:08:54 PST
Received: from Coraki.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04364; Thu, 4 Jan 90 14:07:47 -0800
Received: from amadeus.Stanford.EDU by coraki.stanford.edu (4.1/25-eef) id AA09042; Thu, 4 Jan 90 14:08:02 PST
Received: by amadeus.Stanford.EDU (5.57/Ultrix2.4-C)
id AA06220; Thu, 4 Jan 90 14:10:08 PST
Date: Thu, 4 Jan 90 14:10:08 PST
From: dill@amadeus.Stanford.EDU (David Dill)
Message-Id: <9001042210.AA06220@amadeus.Stanford.EDU>
To: phd-adm@coraki.stanford.edu
Subject: admissions committee
I think I can be half of a systems representative.
∂04-Jan-90 1421 LOGMTC-mailer A logic seminar
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jan 90 14:21:10 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA22531; Thu, 4 Jan 90 14:23:16 PST
Date: Thu 4 Jan 90 14:23:15-PST
From: John Etchemendy <ETCH@CSLI.Stanford.EDU>
Subject: A logic seminar
To: logic@russell.Stanford.EDU, phil-all@russell.Stanford.EDU
Message-Id: <631491795.0.ETCH@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SEMINAR ANNOUNCEMENT
Philosophy 396
Issues in Logical Theory
Tuesday 3:15-5:05
Ventura Seminar Room
John Etchemendy and Solomon Feferman
In this seminar we will be covering topics in philosophical logic,
broadly construed. We plan to have sessions on a variety of chapters
from the Handbook of Philosophical Logic -- specific chapters to be
determined by the interests of the participants -- as well as sessions
on similar topics not covered in the Handbook. In the first meeting,
Jon Barwise will present recent work by Barwise and Etchemendy on the
algebra of information.
-------
∂04-Jan-90 1658 LOGMTC-mailer MSRI seminar listing for January 8 - 12, 1990
Received: from msri.org (gauss.msri.org) by SAIL.Stanford.EDU with TCP; 4 Jan 90 16:58:03 PST
Received: by msri.org (AIX 2.1.2/s2.2)
id AA01019; Thu, 4 Jan 90 16:53:35 PST
Date: Thu, 4 Jan 90 16:53:35 PST
From: abaxter@msri.org (Arlene Baxter)
Message-Id: <9001050053.AA01019@msri.org>
To: weekly@msri.org
Subject: MSRI seminar listing for January 8 - 12, 1990
Cc: abaxter@msri.org
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 Centennial Drive * Berkeley, CA 94720 * (415) 642-0143
Seminar Announcements for the period
January 8 - 14, 1990
Monday, January 8
RECURSION THEORY 11:30 MSRI Seminar Room
P. Cholak "Automorphisms of the lattice of R.E. sets: A survey"
Tuesday, January 9
MODEL THEORY 1:00 MSRI Lecture Hall
P. Komjath "Partitions of vertices"
ALGEBRAIC TOPOLOGY 2:15 MSRI Lecture Hall
V. Snaith "A problem of C.T.C. Wall concerning class groups"
SET THEORY 3:30 MSRI Lecture Hall
J. Steel "Iteration trees" (Continued)
Wednesday, January 10
ALGEBRAIC TOPOLOGY 2:15 MSRI Lecture Hall
C.N. Lee "The Segal conjecture for compact Lie groups"
RECURSION THEORY 3:30 MSRI Lecture Hall
M. Stob "Automorphisms of the lattice of R.E. sets: Orbits"
Thursday, January 11
CROSS-CULTURAL SEMINAR 10:30 MSRI Lecture Hall
G. Cherlin "Totally categorical theories"
ALGEBRAIC TOPOLOGY 2:15 MSRI Lecture Hall
G. Segal "Title to be announced"
Friday, January 12
NO LECTURES TODAY
Saturday - Sunday, January 13 - 14
The PACIFIC GEOMETRY SEMINAR will meet at MSRI on Saturday,
January 13 and Sunday, January 14. The first talk will be at 11:00 A.M. on
Saturday; Graeme Segal will speak on "Quantum Field Theory and Geometry".
∂05-Jan-90 0708 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STUDY OF CONSCIOUSNESS WITHIN SCIENCE--INTL' CONFERENCE
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jan 90 07:08:43 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24532; Fri, 5 Jan 90 07:08:25 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21192; Fri, 5 Jan 90 07:07:49 -0800
Message-Id: <9001051507.AA21192@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8593; Fri, 05 Jan 90 08:31:59 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8569; Fri, 05 Jan 90 08:31:33 CST
Date: Fri, 5 Jan 90 08:30:05 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Ravi Gomatam <bvi@cca.ucsf.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Ravi Gomatam <bvi%cca.ucsf.edu@VM1.NoDak.EDU>
Subject: STUDY OF CONSCIOUSNESS WITHIN SCIENCE--INTL' CONFERENCE
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
------- FIRST INTERNATIONAL CONFERENCE --------
on the study of
CONSCIOUSNESS WITHIN SCIENCE
Feb. 17-18, 1990
Cole Hall, UCSF, San Francisco
CALL FOR REGISTRATION
----------------------------------------------------------------
ORGANIZING COMMITTEE ADVISORY BOARD
T.D. Singh Henry Stapp
R.L. Thompson Karl Pribram
Ravi Gomatam E.C.G. Sudarshan
K.P. Rajan David Long
----------------------------------------------------------------
PURPOSE:
In this century, developments in a variety of fields including
quantum physics, neuro sciences and artificial intelligence have
revealed the necessity for gaining an understanding of the nature
of consciousness and its causal interplay in the study of even
matter. The present conference will examine the the
methodological tools and problems in the study of consciousness
from the perspective of a wide range of scientific fields.
Prominent scholars will share and discuss their research through
invited presentations and question and answer sessions. The
discussions will focus on the role of consciousness as a vital
component of the scientific investigation of the natural world.
INVITED PRESENTATIONS INCLUDE:
NEW CONCEPTS ON THE MIND-BRAIN PROBLEM
JOHN ECCLES Neurosciences, Switzerland Nobel Laureate
A QUANTUM THEORY OF CONSCIOUSNESS
HENRY STAPP Theoretical Physics, Lawrence Berkeley Labs.
BRAIN STATES AND PROCESSES AS DETERMINANTS OF THE CONTENTS OF
CONSCIOUSNESS
KARL PRIBRAM Neuropsychology, Stanford University
CONSCIOUSNESS: IMMANENT OR TRANSCENDENT?
ROBERT ROSEN Biophysics, Dalhousie University
USE OF CONSCIOUS EXPERIENCE IN UNDERSTANDING REALITY
BRIAN JOSEPHSON TCM Group, Cambridge University Nobel Laureate
WAVE MECHANICS OF CONSCIOUSNESS - ROBERT JAHN
Engineering Anomalies Group, Princeton University
ENGINEERING ANOMALIES RESEARCH - BRENDA DUNNE
Engineering Anomalies Group, Princeton University
SPONTANEITY OF CONSCIOUSNESS: A PROBABILISTIC THEORY OF MEANINGS
AND SEMANTIC ARCHITECTONICS OF PERSONALITY - V. NALIMOV
Mathematical Theory of Experiments, Moscow State University
EVOLUTION AND CONSCIOUSNESS
A.G. CAIRNS-SMITH Molecular Chemistry, Glasgow University
PATTERNS IN THE UNIVERSE
E.C.G. SUDARSHAN Theoretical Physics, Univ. of Texas, Austin
WHAT IS WRONG WITH THE PHILOSOPHY OF MIND?
JOHN SEARLE Cognitive Philosophy, U.C., Berkeley
A TRANS-TEMPORAL APPROACH TO MIND-BRAIN INTERACTION
R. L. THOMPSON Mathematical Biology, Bhaktivedanta Institute, SF
BIOLOGICAL COHERENCE--CONNECTIONS BETWEEN MICRO AND MACRO PHYSICS
H. FROHLICH Theoretical Physics, University of Liverpool
__________________________________________________
Participation is by registration. Besides these invited
talks, there will be question/answer sessions, panels and a poster
session. The program format will afford registered participants
ample opportunity for interaction with the distinguished guests.
Early registration is encouraged.
REGISTRATION FEE: $125.00 before January 15, 1990;
$75.00 Full time students (limited seats)
[Fee includes luncheon on both days]
$150/$85 after January 15.
To register, please send check/money order (in U.S. dollars
only) drawn in favor of the Bhaktivedanta Institute to the
conference secretariat. Please include name, address,
institutional affliation and research interests (if any) of the
registrant.
CALL FOR PAPERS:
While all oral presentations are by invitation only,
opportunities exist for registered participants to present papers
in poster sessions on any topic related to the broad theme of the
conference. Three hard-copies of a full paper (8000 words) or
extended abstract (1000 words) submitted before December 29, 1989
are assured of full consideration.
Please direct all registration requests, paper submissions and
inquiries to:
Ravi V. Gomatam, Organizing Secretary
THE BHAKTIVEDANTA INSTITUTE
84 Carl Street
San Francisco, CA 94117 U.S.A.
Tel: (415)-753-8647/8648
E-Mail: INTERNET: bvi@cca.ucsf.edu
BITNET: bvi@ucsfcca
CONFERENCE HOST: The Bhaktivedanta Institute - A private non-
profit research organization promoting international discussions
on consciousness-based perspectives in relation to outstanding
problems in various areas of modern science. The institute has
centers in Bombay and San Francisco and a staff of twenty
concerned scientists from different fields.
* * * * *
∂05-Jan-90 0709 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary of replies for PD theorem prover
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jan 90 07:09:41 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24549; Fri, 5 Jan 90 07:09:27 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21197; Fri, 5 Jan 90 07:08:32 -0800
Message-Id: <9001051508.AA21197@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8427; Fri, 05 Jan 90 08:30:38 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8409; Fri, 05 Jan 90 08:30:36 CST
Date: Fri, 5 Jan 90 08:29:34 CST
Reply-To: "Steve K. Roggenkamp" <skr%uncle.UUCP%uunet.uu.net@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Steve K. Roggenkamp" <skr%uncle.UUCP%uunet.uu.net@VM1.NoDak.EDU>
Subject: Summary of replies for PD theorem prover
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Thanks to all who replied to my request for a public domain theorem
prover.
Several people wrote about the Otter system developed at Argonne
National Labs by Bill McCune. This system has the advantages of being
written in C and is fast. It is available from two sites,
herky.cs.uiowa.edu and dopey.cs.unc.edu. Instructions to obtain,
provided by Joachim Posegga <posegga@ira.uka.de> are:
>Otter is obtainable from herky.cs.uiowa.edu username anonymous,
>password guest, go to public/otter and follow the directions in README.
>dopey.cs.unc.edu username anonymous, password guest, go to pub/Otter
>and follow the directions in README.
Werner Vogels (relay.EU.net!nikhefk!werner) mentioned the Rule Rewrite
Laboratory (RRL), an interactive system developed at Iowa University
by Deepak Kapur (kapur@albanycs.albany.edu and Hantao Zhang
(hzhang@herky.cs.uiowa.edu).
My own personal interest in this area is using a theorem prover as an
aid for formal program specifications and to become more familiar with
this area of computer science. It seems a theorem prover should be
useful for this purpose, although I do not have any experience in
using them. I would like to use it to assist me with the details of
checking software specifications, but I'm leery of the amount of
detail they might spew forth. The only way I can judge the usefulness
of this approach is to try it and evaluate the results. If I find
something useful, I'll post it to the net.
Thanks again to all who replied.
Steve R.
-----
Steven K. Roggenkamp, skr@uncle.UUCP, n8emr!uncle!skr@osu-cis.cis.ohio-state.edu
(614) h:792-8236, w:764-4208;
--
-----
Steven K. Roggenkamp, skr@uncle.UUCP, n8emr!uncle!skr@osu-cis.cis.ohio-state.edu
(614) h:792-8236, w:764-4208;
------------------------------------------------------------------------
Date: 28 Dec 89 18:18:32 GMT
From: jon@june.cs.washington.edu (Jon Jacky)
Organization: U of Washington, Computer Science, Seattle
Subject: Re: Summary of replies for PD theorem prover
Message-Id: <10243@june.cs.washington.edu>
References: <647@uncle.UUCP>
A review of many theorem-proving systems appears in an article in the British
periodical, SOFTWARE ENGINEERING JOURNAL, vol 3 no 1, Jan 1988: "A Survey of
Mechanical Support for Formal Reasoning" by Peter A. Lindsay.
This review discusses the following systems at length: LCF, NuPRL, Veritas,
Isabelle, Affirm, the Boyer-Moore Prover, and the Gypsy Verification
Environment. He also briefly discusses Abstract Pascal, B, the CSG proof
editor, enhanced HDM, FDM, HOL, Interactive Proof Editor, IOTA, NEVER, REVE,
and the Stanford Pascal Verifier.
I seem to recall that he discusses avialability, public domain or otherwise,
for each of these systems.
- Jonathan Jacky, University of Washington, Seattle, WA
jon@gaffer.rad.washington.edu
∂05-Jan-90 0939 keyes@sierra.STANFORD.EDU EE Faculty Meeting
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 5 Jan 90 09:38:56 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Fri, 5 Jan 90 09:35:08 PST
Date: Fri, 5 Jan 90 09:35:08 PST
From: keyes@sierra.STANFORD.EDU (Gloria L. Keyes)
To: EE-faculty@sierra
Cc: keyes@sierra
Subject: EE Faculty Meeting
Message-Id: <CMM.0.88.631560906.keyes@>
There will be an EE Faculty Meeting on Monday, Jan. 8, at 4:15PM, at which
time degree conferral will be voted upon. The mtg will be held in McC 240.
Gloria Keyes
∂05-Jan-90 1135 LOGMTC-mailer talks
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jan 90 11:35:28 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27457; Fri, 5 Jan 90 11:35:28 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA12243; Fri, 5 Jan 90 11:24:07 PST
Message-Id: <9001051924.AA12243@iswim.stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: talks
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Fri, 05 Jan 90 11:24:06 PST
Sender: jcm@iswim.Stanford.EDU
This quarter's Tuesday logic/MTC/programming language
seminar will not meet Tues Jan 9, but will begin
Tues Jan 16 with a talk by Harry Mairson of Brandeis
on the complexity of ML type inference.
I would also like to schedule a talk by Phil Wadler
of Glasgow that week. We have two talks scheduled
Tues the 16-th, then other by Charles Consel, at 11am
on partial evaluation.
How many people would like to hear from Wadler on
Tuesday, but would NOT be able to come to a talk
on Monday the 15-th (Martin Luther King Day)?
PS. I know that both days conflict with the ASL meeting
in Berkeley.
∂05-Jan-90 1359 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: PD theorem prover
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jan 90 13:59:00 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13382; Fri, 5 Jan 90 13:58:25 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00965; Fri, 5 Jan 90 13:57:40 -0800
Message-Id: <9001052157.AA00965@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9842; Fri, 05 Jan 90 15:56:11 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9828; Fri, 05 Jan 90 15:56:08 CST
Date: Fri, 5 Jan 90 15:54:53 CST
Reply-To: PAAAAAR%CALSTATE.BITNET@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: PAAAAAR%CALSTATE.BITNET@VM1.NoDak.EDU
Subject: Re: PD theorem prover
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Steven K. Roggenkamp, skr@uncle.UUCP,
wrote
>My own personal interest in this area is using a theorem prover as an
>aid for formal program specifications
[...]
> It seems a theorem prover should be
> useful for this purpose
Woodcock (of the Z group at Oxford University (Engleand))
wrote a paper on this recently. He/it claimed that a program by Abrial
was a great help in the construction of proofs.
Woodcock 89b, JCP Woodcock, Calculating Properties of Z
Specifications, ACM SIGSOFT Software Engineering Notes, v14n5(Jul 89)pp43-54
∂05-Jan-90 1715 LOGMTC-mailer darlington seminar, 1/10, 4:15pm, ej228, sri
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 5 Jan 90 17:15:09 PST
Date: Fri 5 Jan 90 16:59:39-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: darlington seminar, 1/10, 4:15pm, ej228, sri
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@SAIL.STANFORD.EDU,
colloq@SCORE.STANFORD.EDU, bboard@Warbucks.AI.SRI.COM,
su-bboards@SAIL.STANFORD.EDU
Message-ID: <631587579.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
when: Wednesday, January 10, 4:15pm
where: AI Center Conference Room EJ228, Building E, SRI
what:
A TRANSFORMATION-BASED PROGRAMMING ENVIRONMENT
APPLIED TO
THE EXPLOITATION OF PARALLEL MACHINES
Professor John Darlington
Dept of Computing
Imperial College, London
We have developed a programming environment for functional languages that
uniformily supports program development by transformation. The environment
has a range of built-in, automatic transformation operations but has been
designed to be extensible, in that more complex transformations can be
accomplished by programming at the meta-level.
We have recently been applying the ideas of functional programming and
program transformation to develop a uniform methodology for programming,
efficiently, a range of disparate parallel machines, for example, graph
reduction, message passing and SIMD machines.
This talk will give an overview of the environment and the transformation
technology it emodies and give some examples of program developments for
parallel machines.
Visitors to SRI please arrive early. SRI is at 333 Ravenswood Avenue,
Menlo Park. Visitors from US "designated" countries please call Dori
Arceo, 859-2641.
-------
∂05-Jan-90 1715 LOGMTC-mailer darlington seminar, 1/10, 4:15pm, ej228, sri
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 5 Jan 90 17:15:09 PST
Date: Fri 5 Jan 90 16:59:39-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: darlington seminar, 1/10, 4:15pm, ej228, sri
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@SAIL.STANFORD.EDU,
colloq@SCORE.STANFORD.EDU, bboard@Warbucks.AI.SRI.COM,
su-bboards@SAIL.STANFORD.EDU
Message-ID: <631587579.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
when: Wednesday, January 10, 4:15pm
where: AI Center Conference Room EJ228, Building E, SRI
what:
A TRANSFORMATION-BASED PROGRAMMING ENVIRONMENT
APPLIED TO
THE EXPLOITATION OF PARALLEL MACHINES
Professor John Darlington
Dept of Computing
Imperial College, London
We have developed a programming environment for functional languages that
uniformily supports program development by transformation. The environment
has a range of built-in, automatic transformation operations but has been
designed to be extensible, in that more complex transformations can be
accomplished by programming at the meta-level.
We have recently been applying the ideas of functional programming and
program transformation to develop a uniform methodology for programming,
efficiently, a range of disparate parallel machines, for example, graph
reduction, message passing and SIMD machines.
This talk will give an overview of the environment and the transformation
technology it emodies and give some examples of program developments for
parallel machines.
Visitors to SRI please arrive early. SRI is at 333 Ravenswood Avenue,
Menlo Park. Visitors from US "designated" countries please call Dori
Arceo, 859-2641.
-------
∂08-Jan-90 1013 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Max Indep Set
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 10:12:57 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19490; Mon, 8 Jan 90 10:12:34 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19584; Mon, 8 Jan 90 10:12:13 -0800
Message-Id: <9001081812.AA19584@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2170; Mon, 08 Jan 90 11:37:48 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2150; Mon, 08 Jan 90 11:37:45 CST
Date: Mon, 8 Jan 90 11:36:04 CST
Reply-To: lucas%PSUVAX1.BITNET@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: lucas%PSUVAX1.BITNET@VM1.NoDak.EDU
Subject: Max Indep Set
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Does anyone have pointers to a practical approximation
algorithm for the maximum independent set problem?
Thanks, Joan Lucas
∂08-Jan-90 1124 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CFP: MFCS '90
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 11:18:53 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22984; Mon, 8 Jan 90 11:18:14 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21104; Mon, 8 Jan 90 11:17:13 -0800
Message-Id: <9001081917.AA21104@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0001; Mon, 08 Jan 90 13:15:36 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9881; Mon, 08 Jan 90 13:15:34 CST
Date: Mon, 8 Jan 90 13:14:48 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Hans Rohnert <ssbell!mcmi!denny@uunet.uu.net>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Hans Rohnert <ssbell!mcmi!denny%uunet.uu.net@VM1.NoDak.EDU>
Subject: CFP: MFCS '90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Due to still lacking email connections to the East bloc
I have been asked to post the following
Call for Papers
to the
Fifteenth International Symposium on
Mathematical Foundations of Computer Science (MFCS '90)
August 27-30, 1990
Banska Bystrica, Czechoslovakia
The MFCS '90 is the fifteenth in the series of MFCS symposia organized
in Czechoslovakia and Poland. The aim of these symposia is to bring
together specialists in theoretical fields of computer science
from various countries and to stimulate mathematical research
in theoretical computer science.
Principal areas of interest include
- algorithms and data structures
- models of computation
- automata and formal languages
- theoretical aspects of VLSI systems
- computational geometry
- parallel and distributed computing
- semantics and logics of programs
- cryptography
- theory of data bases and knowledge systems
- theory of robotics and artificial intelligence
This is not intended to be an exhaustive list.
The proceedings of the symposium will be available at the meeting.
The scientific program of the symposium will include
- invited lectures
covering areas of current interest
- short communications
describing original research
LOCATION AND TIME
The symposium will be held in Banska Bystrica, on August 27-31, 1990.
SUBMISSION OF PAPERS
Authors are invited to submit six copies of a full draft paper
of the size of 7-15 LNCS-like pages in English to the chairman
of the Program Committee
===================
by January 15, 1990
===================
Too short (long) submissions risk that the Program Committee will
not be able to fully appreciate their merit because of the lack
of information (time).
Authors will be notified of acceptance or rejection
on April 1, 1990
The final text of accepted papers, typed on special forms, is due
by May 15, 1990
PROGRAM COMMITTEE CHAIRMAN
Branislav ROVAN (Bratislava)
PROGRAM COMMITTEE
Abiteboul (Paris), Bjorner (Lyngby), Broy (Passau), Chytil (Prague),
Constable (Ithaca), van Emde Boas (Amsterdam), Fischer (New Haven),
Guessarian (Paris), Ibarra (Minneapolis), Kanellakis (Providence),
Korec (Bratislava), Kotov (Novosibirsk), Lupanow (Moscow),
Mehlhorn (Saarbruecken), Mirkowska (Warsaw), Mundici (Milan),
Nemeti (Budapest), Rackoff (Toronto), Salomaa (Turku), Wechsung (Jena)
ADDRESS OF THE PROGRAM AND ORGANIZING COMMITTEES
MFCS '90
Institute of Computer Science
Comenius University
842 43 Bratislava
Czechoslovakia
Tel: (+427) 327 469
Telex: 092 502 uvtuk c
∂08-Jan-90 1403 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Max Indep Set
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 14:02:57 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA03991; Mon, 8 Jan 90 14:02:29 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24481; Mon, 8 Jan 90 14:01:27 -0800
Message-Id: <9001082201.AA24481@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9642; Mon, 08 Jan 90 15:59:41 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9628; Mon, 08 Jan 90 15:59:36 CST
Date: Mon, 8 Jan 90 15:58:59 CST
Reply-To: Magnus M Halldorsson <halldors%paul.rutgers.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Magnus M Halldorsson <halldors%paul.rutgers.edu@VM1.NoDak.EDU>
Subject: Re: Max Indep Set
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <9001072141.AA22393@porthos.rutgers.edu> lucas@PSUVAX1.BITNET writes:
> Does anyone have pointers to a practical approximation
> algorithm for the maximum independent set problem?
If you're looking for *performance guarantees* on general graphs,
you're out of luck: there are no polynomial algorithms known.
If you're thinking about good average case behaviour, the greedy
method does within a factor of 2 on random graphs.
Magnus
∂08-Jan-90 1417 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU extrapolation of weighted points in a plane (whew!)
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 14:17:19 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04714; Mon, 8 Jan 90 14:16:35 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24779; Mon, 8 Jan 90 14:14:35 -0800
Message-Id: <9001082214.AA24779@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0641; Mon, 08 Jan 90 16:12:41 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0628; Mon, 08 Jan 90 16:12:39 CST
Date: Mon, 8 Jan 90 16:11:46 CST
Reply-To: Jennifer S Lanham <jenlan%eos.arc.nasa.gov@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Jennifer S Lanham <jenlan%eos.arc.nasa.gov@VM1.NoDak.EDU>
Subject: extrapolation of weighted points in a plane (whew!)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Problem: A set of points in the X,Y plane. Each point has
a weight. I would like to assign weights to all points on the
plane by extrapolating and combining the weights of the given
set.
Simple Example: I have a set of 2 points A, B with weights wA, and wB
(wB > wA). The distance between A and B is 5. The five points are
given weights: wA + ((wB - wA)*1/5), wA +((wB - wA)*2/5), etc. In
other words it is an even ramp of weights from A to B.
The above example is not too difficult to program since I am limiting
the area of the X, Y plane I will use. Also, whereas a very fine ramp
was used above, I will probably use a ramp 10 to 20 times coarser. (?)
This routine will actually be assigning weights to pixels, so all
calculation (distances etc.) will eventually have to be rounded to
integral values.
Does anyone know of a source of information for an algorithm to deal
with this, or some related problem?
E-Mail to address below, or post if there's interest.
Thankyou,
Jennifer S. Lanham
jenlan@eos.arc.nasa.gov
∂08-Jan-90 1424 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU S. Wolfram and computational irreducibility
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 14:24:05 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05088; Mon, 8 Jan 90 14:23:10 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24846; Mon, 8 Jan 90 14:17:43 -0800
Message-Id: <9001082217.AA24846@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0683; Mon, 08 Jan 90 16:13:21 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0671; Mon, 08 Jan 90 16:13:02 CST
Date: Mon, 8 Jan 90 16:12:10 CST
Reply-To: Kihong Park <park%usceast.UUCP%uunet.uu.net@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Kihong Park <park%usceast.UUCP%uunet.uu.net@VM1.NoDak.EDU>
Subject: S. Wolfram and computational irreducibility
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Steven Wolfram has coined a term called "computational irreducibility" to
mean(to the best of my interpretation) that for cellular automata
capable of universal computation, there exist problems concerning their
behavior which are undecidable. That is, to compute the global configuration
of a CA at the n'th iterative step, in general, an algorithm has no
recourse but to compute(i.e., simulate) all the intermediate steps to
arrive at the outcome.
This is all dandy and fine since the undecidability of the halting problem
and other undecidable problems have been known for some time. But here is
the problem that I have: He seems to very well know that the concept of
undecidability is applicable only to problems which have an infinite number
of instances. This means that IN GENERAL, there does not exist an algorithm,
i.e., a halting turing machine which solves the halting problem for any
turing machine / input word pair. But in some of his writings where he
uses the term "computational irreducibility"(a listing is appended), he
makes statements strongly suggesting(this is my subjective impression) that
even for individual problem instances, one has no recourse but to explicitly
simulate a computational process(e.g. CA) to compute its outcome.
Based on this, he makes "matter of fact" claims that many physical systems
are of such character and hence their exact behavior predictable by observation
through explict simulation only. It annoys me that he uses undecidability
results in such a free and rather misleading fashion. Undecidability, and hence
computational irreducibility(as he uses it) are results of a very general
character and hence not applicable to everyday problem instances. One should not
confuse problems having infinite instances with "one-instance" problems.
Here is a problem where the term "computational irreducibility" takes on a
more comprehensive meaning, but totally different in its implication and
interpretation from what Steven Wolfram has used:
One can write a procedure for computing the decimal expansion of root of 2
which at every interative i'th step outputs the i'th digit of the expansion.
One can then ask a question such as, "will the one-way infinite sequence
associated with this non-halting procedure contain a finite substring of
some specified pattern?". To the best of my knowledge, there do not exist
known short-cuts to answering this question without peforming the computation
ad infinitum in case the answer to the question is "no".
For this question, and for any other one-instance problems, undecidability
results are of no use. This is so because undecidability of the halting
problem does not imply that there exist halting problem instances for
which the answer cannot be obtained by effective means. Hence a valid
question and more interesting usage of the term "computational irreducibility"
would be its association with one-instance problems. Thus, a generalization
of the root of 2 problem would be as follows:
Does there exist a non-halting procedure with its corresponding infinite
sequence such that to compute the n'th symbol of the sequence, the n-1 preceding
output symbols have to be computed, i.e., there does not exist a short-cut?
If indeed this can be proven, then one has good occasion to use the term
"computational irreducibility" to describe this situation. Moreover, one can
modify the infinite procedure so that it halts if and only if the associated
infinite sequence contains a finite subsequence satifying a certain computable
condition. In addition, if one can show that there must exist computable
properties of the associated infinite sequence that are false, one has a proof
of the halting problem.
I would be thankful for comments regarding a proof for the redefined
"computational irreducibility" concept as illustrated above. Here are some
references to Steven Wolfram's articles:
1. S. Wolfram "Origins of randomness in physical systems", Phys.Rev.Lett.55,
1985,449.
2. S. Wolfram "Undecidability and intractability in theoretical physics",
Phys.Rev.Lett.54,1985,735.
3. S. Wolfram "Twenty Problems in the Theory of Cellular Automata", Physica
Scripta, Vol.T9,170-183,1985.
∂08-Jan-90 1527 ingrid@russell.Stanford.EDU New Visitor
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 15:26:44 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA13745; Mon, 8 Jan 90 15:09:33 PST
Date: Mon, 8 Jan 90 15:09:33 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001082309.AA13745@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: New Visitor
MICHIO ISODA
Industrial Affiliates Program Visiting Researcher
WACOM Co. Ltd., Japan
Dates of visit: January 1990-December 1990
Michio is interested in machine(-aided) translation (MAT) and lexical
knowledge base (LKB). While at CSLI, he would like to import the
results of contemporary linguistics theories into MAT and LKB in order
to build simpler, more flexible systems. His research interests also
include related topics, such as language-knowledge acquisition and the
application of techniques that have been developed in the context of
research on MAT.
∂08-Jan-90 1657 ingrid@russell.Stanford.EDU CSLI events tomorrow
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jan 90 16:57:43 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA15030; Mon, 8 Jan 90 16:38:22 PST
Date: Mon, 8 Jan 90 16:38:22 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001090038.AA15030@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI events tomorrow
SEMINAR ANNOUNCEMENT
Philosophy 396
Issues in Logical Theory
John Etchemendy and Solomon Feferman
Tuesdays, 3:15-5:05
CSLI, Ventura 17
In this seminar, we will be covering topics in philosophical logic,
broadly construed. We plan to have sessions on a variety of chapters
from the Handbook of Philosophical Logic -- specific chapters to be
determined by the interests of the participants -- as well as sessions
on similar topics not covered in the Handbook. In the first meeting,
Jon Barwise will present recent work by Barwise and Etchemendy on the
algebra of information.
------------
SYNTAX WORKSHOP
The Morphology of Affectedness in Kimaragang Dusun
Paul Kroeger
Tuesday, 9 January, 7:30pm
CSLI, Cordura 100
This paper argues that a number of puzzles in the morphosyntax of
verbs in Kimaragang Dusun (a Philippine-type language spoken in Sabah,
East Malaysia) can be solved using the notion of "affectedness." The
analysis to be presented is based on the proposal by Jackendoff (1987)
that "affectedness" relations are distinct from thematic roles, and
are represented as a separate "action tier."
For any given predicate in Kimaragang, there may be several options as
to which argument on the thematic tier will be projected as the
affected argument on the action tier. I will use the term Undergoer
for the affected argument. I will show that a basic principle of
Kimaragang grammar is the following: the thematic role of the
Undergoer must be registered in the verbal morphology. If the
Undergoer is selected as "Pivot" (or grammatical subject), its
thetarole will be reflected by the choice of voice marker on the verb.
If the Undergoer is not selected as the grammatical subject, the verb
must carry an additional prefix, either poN- or po-, depending on the
thematic role of the Undergoer.
Crucial evidence for these claims will be drawn from dative
alternation, arising with verbs like `give', which allow either the
theme or recipient to be chosen as Undergoer, and from applicative
constructions, in which an instrument, benefactive, or locative
replaces the patient as Undergoer.
The next workshop will be MONDAY, 22 January, and the speaker will be
Lars Hellan. Future meetings will be on 6 and 20 February.
∂09-Jan-90 0119 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM A&S trivium
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 9 Jan 90 01:19:35 PST
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 463969; 9 Jan 90 04:17:16 EST
Received: from BRAIN-DAMAGE.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 115030; Tue 9-Jan-90 01:15:37 PST
Date: Tue, 9 Jan 90 01:15 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: A&S trivium
To: math-fun@RUSSIAN.SPA.Symbolics.COM, macsyma-i@RUSSIAN.SPA.Symbolics.COM,
"wri-tech@wri.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"hul@psuvm.psu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
cc: "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "dek@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900108090646.1.RWG@BRAIN-DAMAGE.SPA.Symbolics.COM>
Message-ID: <19900109091533.2.RWG@BRAIN-DAMAGE.SPA.Symbolics.COM>
Date: Mon, 8 Jan 90 01:06 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
I finally gave up looking for my annotated A&S, and
borrowed Peter Weyhrauch's. So now I am trying to
reconstruct my annotations. The first one is the
obvious oversight
15.1.19a F[a, 1/2+a; 3/2 | -(tan z)↑2]
(cos z)↑(2a) sin (2a-1)z
= ------------ -----------
sin z 2a-1
(Chebychev 2nd kindred)
(by analogy with 15.1.9, 15.1.19, and 15.1.10).
(with Cheby the 1st in 15.1.19)
Nice check is lim a->1/2.
z↑n
15.1.6a F[1, 1; 1/2 | z] = Sum ----------
n Binom(2n,2)
1 + (sqrt z/(4-z)) atan sqrt z/(4-z)
= ------------------------------------ .
1 - z/4
The importance of these is that they are contiguous to 15.1.19
and 15.1.6, and from any contiguous pair can be derived the
closed form for 2F1s with parameters differing by any integer(s),
via the three-term recurrences in 15.2. (Or more neatly, via
matrices.)
So by omitting these two, A&S omitted countable infinities of
identities.
Erratum: In 15.1.30, replace 5/6+a by 5/6+2a/3, as can be
guessed from the rhs.
Several 2F1s could be added to this page, including Heymann's
pair with z = 1/5, and a couple with z = <quadratic surd>.
(Unhandily) contiguous pairs can be formed by gunching the free
parameter, but, in general, the pair will not be "contiguous
enough" to appear in 15.2. To get a close pair, one must
construct and solve a system of simultaneous equations which
spans the known pair.
While this would be a useful computer algebra package, the
result of such an approach will likely be drastically
undersimplified.
On the other hand, contiguous pairs are generated automatically
via the matrix derivations.
∂09-Jan-90 0815 LOGMTC-mailer seminar
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker: Timothy G. Griffin, Department of Computer Science, UNICAMP, Brazil
Title: A Formulae-as-Types Notion of Control
Time: Thursday, January 11, 4pm
Place: 252 MJH (Stanford CSD)
Abstract:
The formulae-as-types correspondence relates a constructive proof of
a formula A to a program of type A. This correspondence has been restricted
to constructive logic because it is widely believed that, in general,
classical proofs lack computational content. This talk will show, however,
that the formulae-as-types correspondence can be extended to classical logic
in a computationally interesting way. We will see that classical proofs
posses computational content when the notion of computation is extended to
include explicit access to the current control context.
This notion of computation is found in the programming language
Scheme, a LISP dialect which contains the control construct call/cc that
provides access to the current continuation (the current control context)
and, in effect, provides Scheme with first-class labels and jumps.
The correspondence is based on Idealized Scheme of Felleisen et al.,
which is essentially ISWIM extended with an operator similar to call/cc.
This talk will be delivered at POPL '90.
∂09-Jan-90 0844 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary of response to Maximum Weight Matchings request.
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Jan 90 08:43:58 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12133; Tue, 9 Jan 90 08:43:33 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11961; Tue, 9 Jan 90 08:43:24 -0800
Message-Id: <9001091643.AA11961@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2752; Tue, 09 Jan 90 10:08:11 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2727; Tue, 09 Jan 90 10:08:09 CST
Date: Tue, 9 Jan 90 10:06:48 CST
Reply-To: John Kececioglu <johnk%arizona.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: John Kececioglu <johnk%arizona.edu@VM1.NoDak.EDU>
Subject: Summary of response to Maximum Weight Matchings request.
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I wish to thank Hershel Safer, Bruce Smith, Jon Turner, Robert Eachus,
Thomas Spencer, and Constantine Osiakwan for generously responding to
my article requesting algorithms for maximum weight matchings in nonbipartite
graphs.
Although I didn't make it clear in the original article, I wasn't
interested in scaling algorithms. The following well-known references
seem to cover the published sequential algorithms:
Zvi Galil, "Efficient algorithms for finding maximum matchings in
graphs," Computing Surveys 18:1 (March 1986) 23-38.
Zvi Galil, Silvio Micali, and Harol Gabow, "An O(E V log V) algorithm
for finding a maximal weighted matching in general graphs," SIAM J.
Computing 15:1 (February 1986) 120-130.
Harold Gabow, Zvi Galil, and Thomas Spencer, "Efficient implementation
of graph algorithms using contraction," JACM 36:3 (July 1989) 540-572.
The survey of Galil is excellent. The algorithm of Gabow, Galil, and
Spencer achieves time O(V↑2 log V + E V log log (log V / log(E/V))).
Apparently, Gabow has designed a new algorithm to be presented at the
Symposium on Discrete Algorithm (SODA) this month, with a running time
of O(V↑2 log V + EV).
With regard to generating matchings in order, I knew only of the following
reference, though I have not read the paper:
K.G. Murty, "An algorithm for ranking all the assignments in
increasing order of cost," Oper. Res. 16 (1968) 682-687.
I received no response regarding which algorithm leads to a fast
implementation. The algorithm of Galil, Micali, and Gabow looks
reasonable, though it does appear that few of the algorithms designed
have ever been implemented. If true, this seems rather unfortunate.
--
John Kececioglu
johnk@cs.arizona.edu or arizona!johnk.uucp
Department of Computer Science, University of Arizona, Tucson, Arizona 85721
"Through small apertures we glimpse abysses whose somber depths turn us faint."
∂09-Jan-90 0844 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Fellowship and job openings
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Jan 90 08:44:13 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12135; Tue, 9 Jan 90 08:43:46 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11969; Tue, 9 Jan 90 08:43:37 -0800
Message-Id: <9001091643.AA11969@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2787; Tue, 09 Jan 90 10:10:10 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2770; Tue, 09 Jan 90 10:08:29 CST
Date: Tue, 9 Jan 90 10:07:05 CST
Reply-To: Ernie Brickell <efbrick%sandia.gov@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ernie Brickell <efbrick%sandia.gov@VM1.NoDak.EDU>
Subject: Fellowship and job openings
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Sandia National Laboratories is seeking outstanding candidates in
the area of theoretical computer science to fill its 1990
Research Fellowship in Computational Science and also to fill a
limited number of regular staff positions. Sandia provides an
exceptional research opportunity for new graduates in theoretical
computer science. We are primarily interested in the areas of
computational geometry and parallel computation, but other
specialties will be considered as well. Sandia provides an
excellent environment for research in theoretical computer
science. Our strong applied research programs in robotics,
parallel computing, and cryptology create a wealth of new
problems in computational geometry, parallel computation, and
computational number theory. In addition, several
leading-edge massively parallel computers are available in the
department.
The fellowship appointment is for a period of one year and may be
renewed for a second year. The fellowship and staff positions
include a highly competitive salary, moving expenses, and a
generous professional travel allowance. The successful candidate
must be a U.S. citizen, must have earned a Ph.D. degree or the
equivalent, and should have a strong background in theoretical
computer science or discrete mathematics. Applications from
qualified candidates, as well as nominations for the Fellowship
should be addressed to Robert H. Banks, Division 3531-23D,
Sandia National Laboratories, P.O. Box 5800, Albuquerque, NM
87185. Applications should include a resume, a statement of
research goals, and the names of three references. Further
inquiries can be made by calling (505)846-7564 or by sending
Email to efbrick@sandia.gov.
∂09-Jan-90 0844 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Program Change in Northeastern's Theory Day, Jan. 19
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Jan 90 08:43:58 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12128; Tue, 9 Jan 90 08:43:17 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11954; Tue, 9 Jan 90 08:43:02 -0800
Message-Id: <9001091643.AA11954@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2708; Tue, 09 Jan 90 10:07:46 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2696; Tue, 09 Jan 90 10:07:43 CST
Date: Tue, 9 Jan 90 10:06:35 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
alan selman <selman@corwin.ccs.northeastern.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: alan selman <selman%corwin.ccs.northeastern.edu@VM1.NoDak.EDU>
Subject: Program Change in Northeastern's Theory Day, Jan. 19
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
IMPORTANT PROGRAM CHANGE
NORTHEASTERN UNIVERSITY THEORY DAY
Friday, January 19, 1990
The College of Computer Science
Northeastern University
2:00 p.m. "Email and the Unexpected Power of Interaction"
Laszlo Babai
University of Chicago and Eotvos University
The talk will give an account of the lightening fast
recent evolution of ideas that have during the
Winter break led to a major revision of our view
of efficient provability and put the relevance of
relativized separation of complexity classes into
question. The principal recent contributors
are N. Nisan (MIT), C. Lund, L. Fortnow,
H. Karloff (U. Chicago), A. Shamir (Weizmann Inst.).
ALL OTHER TALKS ARE AS PREVIOUSLY LISTED:
10:00 a.m. "On Counting Classes"
Gerd Wechsung
Friedrich-Schiller University
11:00 a.m. "Some Considerations on the Average Analysis of
Algorithms in Trees"
Josep Diaz
Universitat Politecnica de Catalunya
3:00 p.m. "Bounds on Universal Transversal Sequences"
Walter L. Ruzzo
University of Washington
All talks will take place in room 356 Ell Center on the Northeastern University
Campus. For information on visitor parking or campus maps, please contact:
Gayle Mackay, 617-437-2464, or gayle@corwin.ccs.northeastern.edu, or
161 Cullinane Hall
College of Computer Science,
Northeastern University
Boston, MA 02115
For further information, contact Alan Selman, 617-437-8736,
selman@corwin.ccs.northeastern.edu.
∂09-Jan-90 1337 NA.PHL@Forsythe.Stanford.EDU Sunrise Club, Jan. 23rd
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 9 Jan 90 13:37:22 PST
Received: from Forsythe.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Tue, 9 Jan 90 13:34:24 PST
Date: Tue, 9 Jan 90 13:32:50 PST
To: ee-faculty@sierra
From: "Portia Leet" <NA.PHL@Forsythe.Stanford.EDU>
Subject: Sunrise Club, Jan. 23rd
The next Sunrise Club breakfast will feature Dr. Dennis R. Carter of
the Mechanical Engineering Department speaking on "Mechanical
Regulation of Skeletal Biology in Health, Disease and Treatment."
The meeting begins at 7:30 a.m. at Tresidder Union Oak Lounge West
on Tuesday, January 23rd.
Dennis Carter is the Director of the Orthopedic Biomechanics
Program. Concentrating upon the influence of mechanical loading on
the growth, development, and aging of skeletal tissues, Carter
designs and evaluates orthopedic implants and procedures.
If you would like to attend, please reply by E-mail to me at
na.phl@forsythe or by phone, 5-1585.
To: SUNRISE(CT.JFK,CT.MJF,CT.PAC,CT.VLS,DOWN@SIERRA,EE-FACULTY@SIERRA,
FACULTY@CS,FULLERTON@SIERRA,GD.WRK,GIBBONS@SIERRA,HAGSTROM@SIERRA,
KINO@SIERRA,KRUGER@SIERRA,LEVINTHAL@SIERRA,NA.ADP,NA.PHL,PHD@CS,
REIS@SIERRA,RES-ASSOC@CS,TAJNAI@CS)
∂09-Jan-90 1337 spicer@sierra.STANFORD.EDU
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 9 Jan 90 13:37:49 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Tue, 9 Jan 90 13:34:44 PST
Date: Tue, 9 Jan 90 13:34:44 PST
From: spicer@sierra.STANFORD.EDU (William E. Spicer)
To: ee-faculty@sierra.STANFORD.EDU
Message-Id: <CMM.0.88.631920882.spicer@>
AS of January 9th there were ten open seats for January 31st and two open
seats for January 24th. I am told that other meetings will be scheduled
if there is any interest.
---------------
Received: from Forsythe.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Mon, 8 Jan 90 10:57:09 PST
Date: Mon, 8 Jan 90 10:57:59 PST
To: spicer@sierra
From: "Joanne Marchetti" <CR.JXM@Forsythe.Stanford.EDU>
Dear Professor Spicer,
Just a note to confirm Bob's message to you that no
one has been turned down from this office for the
Indirect Cost lunches on 1/24 and 1/31. We have taken
reservations for anyone who calls - they do not have
to be from the list of those who sent letters to Bob
on the subject. Please encourage people to call me for
a reservation - Joanne Marchetti at 3-0978. Thank you.
∂09-Jan-90 1739 LOGMTC-mailer Program Tranformation Seminar Reminder, ej228, 4:15pm weds.
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 9 Jan 90 17:39:33 PST
Date: Tue 9 Jan 90 17:27:01-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: Program Tranformation Seminar Reminder, ej228, 4:15pm weds.
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@SAIL.STANFORD.EDU,
colloq@cs.stanford.edu, bboard@Warbucks.AI.SRI.COM,
su-bboards@SAIL.STANFORD.EDU
Message-ID: <631934821.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
speaker: Prof. John Darlington, Imperial College, London
time: Wednesday, 4:15pm, January 10
place: AI Center Conference Room EJ228, SRI (333 Ravenswood, Menlo Park)
topic: on program transformation to exploit parallel machines
Visitors to SRI please arrive early to sign in. Visitors from
US "designated" countries please make prior arrangements with
Ms. Dori Arceo, 859-2641, to be admitted.
-------
∂10-Jan-90 0729 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Max Indep Set
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Jan 90 07:29:29 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA09589; Wed, 10 Jan 90 07:29:15 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06237; Wed, 10 Jan 90 07:25:53 -0800
Message-Id: <9001101525.AA06237@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8473; Wed, 10 Jan 90 09:23:00 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8454; Wed, 10 Jan 90 09:22:58 CST
Date: Wed, 10 Jan 90 09:21:52 CST
Reply-To: Patrick Healy <patrick%okane.cs.umass.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Patrick Healy <patrick%okane.cs.umass.edu@VM1.NoDak.EDU>
Subject: Max Indep Set
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
> Does anyone have pointers to a practical approximation
>algorithm for the maximum independent set problem?
> Thanks, Joan Lucas
I would be interested in approximation algorithms (or references) to the
weighted version of ths problem i.e., Maximum Weighted Independent Set. I've
seen references to some special cases of the related problem: Maximum Weighted
Clique, but nothing for the general case.
Any pointers would be appreciated. Thanks,
Pat Healy,
Univ. of Mass, Amherst.
∂10-Jan-90 0730 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGAL International Symposium on Algorithms, Tokyo, Japan, 1990
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Jan 90 07:30:24 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA09594; Wed, 10 Jan 90 07:29:59 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06566; Wed, 10 Jan 90 07:29:19 -0800
Message-Id: <9001101529.AA06566@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8423; Wed, 10 Jan 90 09:22:27 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8398; Wed, 10 Jan 90 09:22:24 CST
Date: Wed, 10 Jan 90 09:21:39 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Hiroshi Imai <imai@csce.kyushu-u.ac.jp>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Hiroshi Imai <imai%csce.kyushu-u.ac.jp@VM1.NoDak.EDU>
Subject: SIGAL International Symposium on Algorithms, Tokyo, Japan, 1990
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Call for Papers
SIGAL International Symposium on Algorithms
Tokyo, Japan, August 16-18, 1990
The SIGAL International Symposium on Algorithms will be held at the
CSK Information Education Center, Tokyo, Japan in August 16-18, 1990.
The Symposium is organized by the Special Interest Group on Algorithms
(SIGAL) of the Information Processing Society of Japan.
Papers presenting original contributions in the areas of algorithms
are being sought. Typical, but not exclusive, topics of interest
include:
* combinatorial algorithms on graphs, networks and VLSI
* computational geometry and algebra
* data structures
* probabilistic and approximation algorithms
* parallel and distributed algorithms
* cryptography
* computational complexity
The Symposium will consist of several invited talks and contributed
papers. Proceedings will be available at the Symposium. The official
language of the Symposium is English. The Symposium will be held just
before the International Congress of Mathematicians 1990 at Kyoto,
Japan.
Authors are requested to send twelve copies of a detailed abstract of
at most ten double-spaced pages by February 15, 1990, to:
Tetsuo Asano
Osaka Electro-Communication University
Hatsu-cho, Neyagawa, Osaka 572
Japan
e-mail: asano@iscb.osakac.junet or b51847@jpnkudpc.bitnet
SCHEDULE:
Deadline of Submissions: February 15, 1990
Notification of Acceptance or Rejection: April 10, 1990
Camera-Ready Papers: May 10, 1990
INVITED SPEAKERS:
Bernard Chazelle (Princeton U), Zvi Galil (Columbia U),
Rafael Hassin (Tel-Aviv U), Kurt Mehlhorn (U Saarlandes),
Nicholas Pippenger (U British Columbia)
LOCATION:
CSK Information Education Center is located in the west of Tokyo,
and can be reached within 40 minutes by trains from downtown.
The Center has 140 single rooms and 10 twin rooms all of which are to
be used by the Symposium attendants. Many rooms have personal
computers connected by LAN with a host computer. It also has a
swimming pool, a tennis court and an athletic gymnasium.
The registration fee, including board, accommodation, banquet and
proceedings, is about 30,000yen in total.
SYMPOSIUM CHAIRS:
A. Nozaki (ICU), T. Nishizeki (Tohoku U)
PROGRAM COMMITTEE MEMBERS:
Takao Asano (Sophia U), Tetsuo Asano (Osaka EC U, CO-CHAIR),
T. Ibaraki (Kyoto U, CHAIR), Y. Igarashi (Gunma U),
K. Iwano (IBM Tokyo Research Lab), T. Matsumoto (Yokohama NU),
T. Mizoguchi (Mitsubishi), K. Nakamura (NEC),
H. Nakano (Osaka U), K. Sugihara (U Tokyo),
M. Yamashita (Hiroshima U), H. Yasuura (Kyoto U)
LOCAL ARRANGEMENTS:
Y. Igarashi (Gunma U, CHAIR), Takao Asano (Sophia Univ, CO-CHAIR)
∂10-Jan-90 1555 ingrid@russell.Stanford.EDU CSLI Calendar, 11 January 1990, vol. 5:12
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Jan 90 15:55:07 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA01273; Wed, 10 Jan 90 15:22:52 PST
Date: Wed, 10 Jan 90 15:22:52 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001102322.AA01273@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 11 January 1990, vol. 5:12
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
11 January 1990 Stanford Vol. 5, No. 12
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 11 JANUARY 1990
12:00 noon TINLunch
Cordura 100 Reading: The Role of Infons in a Mathematical
Theory of Information, First Draft: January 1990
by Keith Devlin
Discussion led by Pat Hayes
(hayes.pa@xerox.com)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 18 JANUARY 1990
12:00 noon TINLunch
Cordura 100 Twenty-five Basic Theorems in Situation Theory
Ed Zalta
(zalta@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Twenty-five Basic Theorems in Situation Theory
Ed Zalta
This is a revised version of a talk given to STASS in December 1989.
Over the past month, I've refined these views, written them up, and
made them more appropriate for general consumption (as usual, the
paper is available for inspection before the TINLunch). Basically, I
shall try to show that principles that have been _stipulated_ in
previous versions of situation theory fall out as theorems in the
present theory. It makes predictions at most of the branch points in
situation theory, and even predictions concerning the preliminary
structure of situations presupposed by the branch points. The theory
shows that situations and worlds are not incompatible, and indeed, the
former may be parts of the latter. I emphasize that this is not a
mathematical model of states of affairs and situations, but rather a
philosophical theory couched in a predicate modal logic that asserts
that there are properties, relations, states of affairs, situations,
and worlds, among other things, and that they are structured in a
certain way.
____________
SEMINAR ANNOUNCEMENT
Philosophy 396
Issues in Logical Theory
John Etchemendy and Solomon Feferman
(etch@csli.stanford.edu and sf@csli.stanford.edu)
Thursdays, 3:45-5:30
(Note new day and time since last announced!)
Cordura 100
In this seminar, we will be covering topics in philosophical logic,
broadly construed. We plan to have sessions on a variety of chapters
from the _Handbook of Philosophical Logic_ -- specific chapters to be
determined by the interests of the participants -- as well as sessions
on similar topics not covered in the _Handbook_. In the first meeting,
Jon Barwise will present recent work by Barwise and Etchemendy on the
algebra of information.
____________
HISTORY AND PHILOSOPHY OF SCIENCE LECTURE
Aristotelean Logic and Euclidean Mathematics:
17th Century Developments of the "Quaestio de Certitudine Mathematicarum"
Paolo Mancosu
Department of Philosophy
Wolfson College, Oxford
(mancosu@csli.stanford.edu)
Thursday, 11 January, 4:10
Building 200, Room 305
No abstract available.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
On the Status of Proofs by Contradiction in the 17th Century
Paolo Mancosu
Department of Philosophy
Wolfson College, Oxford
(mancosu@csli.stanford.edu)
Friday, 12 January, 3:15
Building 90, Room 92Q
No abstract available.
____________
SEMINAR ON COMPUTERS, DESIGN, AND WORK
The Computer as Social Actor:
Implications of Social Categorization for the User Interface
Cliff Nass
Department of Communication
Stanford University
(nass@suwatson.stanford.edu)
Wednesday, 17 January, 12:15
Ventura 17
What can one learn if one thinks of the human-computer relationship as
a social relationship? This paper develops a set of hypotheses
concerning the ways in which users' social categorizations of
computers affect their expectations, attitudes, and behaviors. In a
context in which a computer misleads users, we discuss the
relationship between (1) the type of information the computer provides
and users' expectations of its utility; (2) users' expectations of how
computers respond when there is misunderstanding or confusion; and (3)
the types and sources of recourse users expect. We propose three
experiments to test the hypotheses. In all three experiments,
subjects are asked to answer a set of trivia questions. A computer
asks the questions and provides facts relevant to the answer. If the
user perceives that the facts are misleading, the user can appeal.
Each experiment manipulates some combination of several factors: (1)
type of question (about humans, computers, or other information
technologies), (2) success of the user's initial guesses (high or
low), (3) mode of appeal (appeal to initial computer, another
computer, a human, or no appeal), (4) result of appeal (recognition,
rectification, or neither), and (5) success of appeal (successful or
unsuccessful).
____________
NEW CSLI VISITORS
Michio Isoda
Industrial Affiliates Program Visiting Researcher
WACOM Co. Ltd., Japan
Dates of visit: January 1990-December 1990
Michio is interested in machine(-aided) translation (MAT) and lexical
knowledge base (LKB). While at CSLI, he would like to import the
results of contemporary linguistics theories into MAT and LKB in order
to build simpler, more flexible systems. His research interests also
include related topics, such as language-knowledge acquisition and the
application of techniques that have been developed in the context of
research on MAT. Michio's email address is isoda@csli.stanford.edu.
Carol Neidle
Boston University
Dates of visit: December 1989-May 1990
Carol Neidle is visiting Xerox PARC and CSLI for six months. She is
on sabbatical leave from Boston University, where she is Associate
Professor and Director of the Program in Applied Linguistics. Her
interests include Russian syntax (she is author of _The Role of Case
in Russian Syntax_, D. Reidel, 1988) and computational tools for
linguistic analysis. At Xerox, she will be working on problems
related to machine translation between English and French. She can be
reached at neidle.pa@xerox.com.
∂11-Jan-90 0738 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for papers: COLT '90
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 07:38:17 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18660; Thu, 11 Jan 90 07:38:06 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02515; Thu, 11 Jan 90 07:35:56 -0800
Message-Id: <9001111535.AA02515@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0157; Thu, 11 Jan 90 09:34:35 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0138; Thu, 11 Jan 90 09:34:33 CST
Date: Thu, 11 Jan 90 09:32:37 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Mark Fulk <fulk@cs.rochester.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Mark Fulk <fulk%cs.rochester.edu@VM1.NoDak.EDU>
Subject: Call for papers: COLT '90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
COLT '90
Third Workshop on Computational Learning Theory
Rochester, NY
August 6 - August 8, 1990
The third workshop on Computational Learning Theory will be held in
Rochester, NY. The conference will be jointly sponsored by SIGACT and
SIGART, and is expected to be similar in style to the previous such
workshops held at MIT and UC/Santa Cruz. Registration at COLT '90 is open.
It is expected that most papers will present rigorous formal analyses
of theoretical issues in Machine Learning. Possible topics include,
but are not limited to: resource and robustness analysis of learning
algorithms, general learnability and non-learnability results in new and
existing computational learning models, theoretical comparisons among
learning models, and papers that connect learning theory with work in
robotics, neural nets, pattern recognition and cryptography. R. Freivalds
(Latvian State University, Riga) has agreed to present an invited talk;
the program committee may consider more such.
Authors should submit an extended abstract that consists of:
A) cover page with title, authors' names,
(postal and e-mail) addresses, and a 200 word summary.
B) body not longer than 10 pages in twelve-point font.
Be sure to include a clear definition of the model used, an overview
of the results, and some discussion of their significance, including
comparison to other work. Proofs or proof sketches should be included
in the technical section. Authors should send 10 copies of their
abstract to
John Case
COLT '90
Department of Computer and Information Sciences
103 Smith Hall
University of Delaware
Newark, DE 19716.
The deadline for receiving submissions is April 9, 1990. This deadline
is FIRM. Authors will be notified by May 22, final camera-ready papers
will be due June 18, and this deadline is ABSOLUTE. The proceedings will
be published by Morgan-Kaufmann. For further information about submissions
contact John Case (telephone: 302-451-2711, email: case@cis.udel.edu).
Chair and local arrangements: Mark A. Fulk (U. Rochester).
Program committee:
J. Case (Delaware, chair),
D. Angluin (Yale),
E. Baum (NEC Research, Princeton)
S. Ben David (Technion, Israel),
M. Fulk (U. Rochester),
D. Haussler (UC Santa Cruz),
L. Pitt (U. Illinois),
R. Rivest (MIT),
C. Smith (Maryland),
S. Weinstein (U. Pennsylvania).
Note: papers that have appeared in journals or that are being submitted
to other conferences are not appropriate for submission to COLT with the
exception of papers submitted to the IEEE 30th Symposium on Foundations of
Computer Science (FOCS).
A joint submission policy coordinated with FOCS permits authors to send
a paper to both conferences; in the event that both conferences accept the
paper, it will be published in the FOCS proceedings, the authors will be
invited to give a talk at both conferences, and a short (one-page) abstract
will be printed in the COLT proceedings.
As the FOCS decisions may be quite late, authors of dual submissions
will be asked to send the abstract with their final copy, so as to
allow the publisher to substitute the abstract upon receiving word of
the FOCS decision.
It is, of course, required that authors notify both committees of the
dual submission by including a note in the cover letters.
∂11-Jan-90 0743 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Symp. on Principles of Database Systems
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 07:43:07 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18797; Thu, 11 Jan 90 07:42:52 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02519; Thu, 11 Jan 90 07:38:19 -0800
Message-Id: <9001111538.AA02519@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0225; Thu, 11 Jan 90 09:36:47 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0212; Thu, 11 Jan 90 09:36:01 CST
Date: Thu, 11 Jan 90 09:33:11 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Moshe Vardi <VARDI@ALMVMA.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Moshe Vardi <VARDI%ALMVMA.BITNET@VM1.NoDak.EDU>
Subject: Symp. on Principles of Database Systems
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
ADVANCE PROGRAM
Ninth ACM SIGACT-SIGMOD-SIGART
Symposium on
Principles of Database Systems (PODS)
Nashville, Tennessee
April 2--4, 1990
SUNDAY, APRIL 1, 1990
Reception: 7:30 pm - 10:00 pm, Suite 4
MONDAY, APRIL 2, 1990
(Note: All talks will take place in Ballroom 1)
SESSION 1: 9:00 am - 10:45 am
Chair: Patrick C. Fischer (Vanderbilt University)
Invited talk: "Research Directions in Object-Oriented Database
Systems," Won Kim (MCC)
"Method Schemas,"
Serge Abiteboul (INRIA), Paris C. Kanellakis (Brown University)
and Emmanuel Waller (INRIA)
"Representability of Design Objects by Ancestor-Controlled
Hierarchical Specifications,"
Lin Yu and Daniel J. Rosenkrantz
(State University of New York at Albany)
Coffee Break: 10:45 am - 11:20 am
SESSION 2: 11:20 am - 12:30 pm
Chair: Shamim Naqvi (Bell Communication Research)
"Query Size Estimation by Adaptive Sampling,"
Richard J. Lipton (Princeton University) and
Jeffrey F. Naughton (University of Wisconsin)
"Deriving Constraints Among Argument Sizes in Logic Programs,"
Allen Van Gelder (University of California at Santa Cruz)
"On the Expressive Power of Datalog: Tools and a Case Study,"
Phokion G. Kolaitis (University of California at Santa Cruz) and
Moshe Y. Vardi (IBM Almaden Research Center)
Lunch: 12:30 pm - 2:00 pm, Davidson Room
SESSION 3: 2:00 pm - 3:30 pm
Chair: C. Mohan (IBM Almaden Research Center)
"Load Control for Locking: The `Half-and-Half' Approach,"
Michael J. Carey, Sanjay Krishnamurthi
and Miron Livny (University of Wisconsin)
"Locks with Constrained Sharing,"
Divyakant Agrawal and Amr El Abbadi
(University of California at Santa Barbara)
"A Serialization Graph Construction for Nested Transactions,"
Alan Fekete (University of Sydney),
Nancy Lynch (MIT) and William Weihl (MIT)
"Multi-Level Recovery,"
Gerhard Weikum (ETH Zurich), Christof Hasse (ETH Zurich),
Peter Broessler (University of Bremen) and Peter Muth
(GMD Institute of Integrated Publishing and Information Systems)
Coffee Break: 3:30 pm - 4:00 pm
SESSION 4: 4:00 pm - 5:30 pm
Chair: Doron Rotem (Lawrence Berkeley Laboratory)
"On the Optimality of Strategies for Multiple Joins,"
Y. C. Tay (National University of Singapore)
"Polynomial Time Program Transformations in Deductive Databases,"
Yatin P. Saraiya (Stanford University)
"Semigroup Techniques in Recursive Query Optimization,"
Thane Plambeck (Stanford University)
"Independence of Logic Database Queries and Updates,"
Charles Elkan (University of Toronto)
Business Meeting: 8:15 pm - 10:00 pm (room t.b.a.)
TUESDAY, APRIL 3, 1990
TUTORIAL: 8:15 am - 9:15 am
"Negation in Deductive Databases,"
Allen Van Gelder (University of California at Santa Cruz)
SESSION 5: 9:30 am - 10:40 am
Chair: Allen Van Gelder (University of California at Santa Cruz)
"Modular Stratification and Magic Sets for DATALOG Programs with
Negation," Kenneth A. Ross (Stanford University)
"Three-Valued Formalization of Logic Programming: Is It Needed?"
Jia-Huai You and Li Yan Yuan (University of Alberta)
"Backward Chaining Evaluation in Stratified Disjunctive
Theories," Veronique Royer (ONERA-CERT)
Coffee Break: 10:40 am - 11:20 am
SESSION 6: 11:20 am - 12:30 pm
Chair: Michael Kifer (State Univ. of New York at Stony Brook)
"The Expressive Power of the Logic Programming Semantics,"
John S. Schlipf (University of Cincinnati)
"Stable Models and Non-Determinism in Logic Programs with
Negation," Domenico Sacca (Universita della Calabria) and
Carlo Zaniolo (MCC)
"Non-Deterministic Languages to Express Deterministic
Transformations,"
Serge Abiteboul (INRIA), Eric Simon (INRIA) and
Victor Vianu (University of California at San Diego)
Lunch: 12:30 pm - 2:00 pm, Davidson Room
SESSION 7: 2:00 pm - 3:20 pm
Chair: Paris C. Kanellakis (Brown University)
Invited talk: "Graph-Theoretic Methods in Database Theory,"
Mihalis Yannakakis (AT&T Bell Laboratories)
"Quasilinear Algorithms for Processing Relational Calculus
Expressions,"
Dan E. Willard (State University of New York at Albany)
Coffee break: 3:20 pm - 3:50 pm
SESSION 8: 3:50 pm - 5:00 pm
Chair: Yannis E. Ioannidis (University of Wisconsin)
"On the Optimality of Disk Allocation for Cartesian Product
Files," Khaled A. S. Abdel-Ghaffar
(University of California at Davis) and
Amr El Abbadi (University of California at Santa Barbara)
"Efficient Processing of Window Queries in the Pyramid Data
Structure,"
Walid G. Aref and Hanan Samet (University of Maryland)
"A Framework for the Performance Analysis of Concurrent B-Tree
Algorithms,"
Theodore Johnson and Dennis Shasha (New York University)
Dinner/Show Cruise: Buses start loading at 6:00 pm
WEDNESDAY, APRIL 4, 1990
SESSION 9: 9:00 am - 10:45 am
Chair: Yehoshua Sagiv
(Hebrew University and Stanford University)
Invited talk: "Introducing Constraints in Programming Systems,"
Jean-Louis Lassez (IBM T. J. Watson Research Center)
"Constraint Query Languages,"
Paris C. Kanellakis (Brown University),
Gabriel M. Kuper (IBM T. J. Watson Research Center) and
Peter Z. Revesz (Brown University)
"Magic Conditions,"
Inderpal Singh Mumick (Stanford University),
Sheldon J. Finkelstein (Tandem),
Hamid Pirahesh (IBM Almaden Research Center) and
Raghu Ramakrishnan (University of Wisconsin)
Coffee Break: 10:45 am - 11:15 am
SESSION 10: 11:15 am - 12:45 pm
Chair: Vassos Hadzilacos (University of Toronto)
"On Being Optimistic about Real-Time Constraints,"
Jayant R. Haritsa, Michael J. Carey and Miron Livny
(University of Wisconsin)
"Token Transactions: Managing Fine-Grained Migration of Data,"
Va-On Tam and Meichun Hsu (Harvard University)
"Data-value Partitioning and Virtual Messages,"
Nandit Soparkar and Abraham Silberschatz
(University of Texas at Austin)
"A Novel Checkpointing Scheme for Distributed Database Systems,"
Slawomir Pilarski and Tiko Kameda (Simon Fraser University)
Lunch Break: 12:45 pm - 2:15 pm (no host)
SESSION 11: 2:15 pm - 3:45 pm
Chair: Richard Hull (University of Southern California)
"Polynomial Time Query Processing in Temporal Deductive
Databases," Jan Chomicki (University of North Carolina)
"Handling Infinite Temporal Data,"
F. Kabanza, J-M. Stevenne and P. Wolper (Universite de Liege)
"GraphLog: A Visual Formalism for Real Life Recursion,"
Mariano P. Consens and Alberto O. Mendelzon
(University of Toronto)
"A Graph-Oriented Object Database Model,"
Marc Gyssens (University of Antwerp),
Jan Paredaens (University of Antwerp) and
Dirk Van Gucht (Indiana University)
End of Symposium
ADVANCE REGISTRATION FORM, ACM-PODS
Please send this form or a facsimile along with a
money order or check (payable to ACM-PODS 90) to:
ACM-PODS 90 Registration
Dept. of Computer Science, Box 1679, Station B
Vanderbilt University, Nashville, TN 37235
(Received before March 1) (After)
ACM and SIG member $250* $270
ACM member only $260* $280
SIG member only $270* $290
Nonmember $295* $320
Full-time Student $ 55 $ 65
Extra cruise ticket? _____ $ 55* N.A.
( * The dinner/show cruise is included only for these categories.)
Name ______________________________________________________
Affiliation __________________________________________________
City __________________________ State ________ Zip ___________
Country ____________________ Telephone ______________________
E-mail Address ______________________________________________
_____ Check here if confirmation of preregistration is desired.
Dietary restrictions: _____ Kosher _____ Vegetarian
Special meals can be guaranteed only for those who register in advance.
Requests for any refunds will be subject to a service charge of $10 before
March 1, 1990, and $30 between March 1 and March 26.
___________________________________________________________
HOTEL RESERVATION FORM, ACM-PODS April 1990
Please mail this form or a facsimile by March 1 to:
Hyatt Regency Nashville
623 Union Street
Nashville, TN 37219
Tel: 615-259-1234 or 800-233-1234
Accommmodations desired (triples and quads are available at $10
per extra person):
_____ Single $74 _____ Double $89
Arrival Date ___________________________ Time ________________
Departure Date _________________________ Time ________________
Name ______________________________________________________
Sharing room with ____________________________________________
Address ____________________________________________________
City _________________________ State _________ Zip ___________
Country ___________________________________
All rooms will be held until 6:00 pm the day of arrival without
a deposit or guarantee. For arrivals later than 6:00 pm, please
guarantee to a major credit card:
_____ Am Ex _____ VISA _____ MC _____ Discover
Card No. ________________________________ Exp. Date __________
Signature ___________________________________________________
CONFERENCE ORGANIZATION
Sponsors: SIGACT, SIGMOD and SIGART
Conference Chair: Daniel J. Rosenkrantz, Dept. of Computer Science,
SUNY-Albany, 1400 Washington Ave., Albany, New York 12222;
djr@cs.albany.edu; tel. 518-442-4274.
Program Chair: Yehoshua Sagiv, Dept. of Computer Science,
Stanford University, Stanford, California 94305;
sagiv@nimbin.stanford.edu; tel. 415-723-3705.
Local Arrangements: Patrick C. Fischer, Dept. of Computer Science,
Box 1679, Station B, Vanderbilt University, Nashville, Tennessee 37235;
pcf@vuse.vanderbilt.edu; tel. 615-322-2863.
Publicity Chair: Raghu Ramakrishnan, University of Wisconsin at Madison.
Program Committee: Vassos Hadzilacos, C. Mohan, Richard Hull,
Shamim Naqvi, Yannis E. Ioannidis, Doron Rotem, Paris C. Kanellakis,
Yehoshua Sagiv, Michael Kifer and Allen Van Gelder.
INFORMATION
HOTEL RESERVATIONS
The Ninth Annual ACM Symposium on Principles of Database Systems
will be held at the Hyatt Regency Nashville, a four-diamond hotel
with atrium design, at 7th Avenue and Union Street downtown.
Recreational privileges with the downtown YMCA are available to
hotel guests.
The hotel address is 623 Union Street Nashville, TN 37219 and
the telephone is 615-259-1234. All technical sessions, two
luncheons and the Business Meeting will be held at the hotel.
A block of rooms has been reserved until March 1, 1990.
Please reserve your room using the form provided or by calling
800-233-1234 or by faxing to 615-259-3017. Be sure to mention
the ACM-PODS Symposium (sometimes erroneously known as the Vanderbilt
CS conference). The special conference room rates of $74 single,
$89 double (plus 11.5% tax) are not guaranteed after March 1.
TRANSPORTATION
The average taxi fare from Nashville International Airport to
downtown is $15. Downtown Airport Express runs a limo service
every 30 minutes from 0600-2300 daily; the one-way fare is $8.
If you are traveling on Sunday, April 1, remember that
Daylight Saving Time begins that day.
CLIMATE
In the beginning of April, Nashville is well into spring. With luck,
the redbuds will be at their peak. The temperature ranges should be:
high 60-70F; low 40-48F. Rain is always a possibility at this time
of year.
THINGS TO DO
The State Capitol, Tennessee State Museum, Ryman Auditorium,
Riverfront Park and Fort Nashboro are within walking distance of
the Hyatt Regency. Vanderbilt University and Centennial Park
(with its famous replica of the Parthenon) are accessible by
public bus or a short taxi ride, as is the Country Music Hall
of Fame.
REGISTRATION
Advanced registration is requested using the form provided. It
is necessary to preregister to have the General Jackson
dinner-and-show Cumberland river cruise included with your
registration. The preregistration period ends on March 1, 1990
because of the deadline set by Opryland, Inc. Additional tickets
for the cruise may be ordered with your preregistration form and
will cost $55. This price includes transportation to and from
the boat dock at Opryland. Availability of cruise tickets at
the meeting is not guaranteed.
Registrants, other than students, receive admission to the technical
sessions, one copy of the proceedings, and two luncheons. If they
preregister by the March 1 deadline, they also receive the dinner/show
cruise on the General Jackson, an old-style (but newly built) stern
wheeler riverboat. Student registration, available to full-time
students only, includes the technical sessions, coffee breaks and
one copy of the proceedings. Students are welcome to attend the
Sunday night reception. The Registration Booth will be open from
6:30 pm - 9:00 pm on Sunday, April 1 in the Foyer of Suite 4.
∂11-Jan-90 0751 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU Meeting time poll
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 07:51:50 PST
Received: from wolvesden.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19091; Thu, 11 Jan 90 07:50:21 -0800
Received: by wolvesden.Stanford.EDU (5.61 (wolvesden 9/7/89)/inc-1.01)
id AA00953; Thu, 11 Jan 90 07:50:03 -0800
Message-Id: <9001111550.AA00953@wolvesden.Stanford.EDU>
To: aflb-all@neon.stanford.edu
Subject: Meeting time poll
Date: Thu, 11 Jan 90 07:50:01 PST
From: Alexander Wang <axwang@wolvesden.Stanford.EDU>
There will be no AFLB this week. Seffi Naor will speak next week at the
first AFLB of the quarter.
It has been suggested that we move the meeting time for AFLB to either
12:00pm or 4:00pm. If you have strong opinions about either of these
times, please send me a note.
∂11-Jan-90 0755 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Any previous work on space-efficient, time-efficient tries?
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 07:54:54 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19230; Thu, 11 Jan 90 07:54:36 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02657; Thu, 11 Jan 90 07:54:23 -0800
Message-Id: <9001111554.AA02657@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0816; Thu, 11 Jan 90 09:53:08 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0802; Thu, 11 Jan 90 09:53:06 CST
Date: Thu, 11 Jan 90 09:52:32 CST
Reply-To: brnstnd%stealth.acf.nyu.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: brnstnd%stealth.acf.nyu.edu@VM1.NoDak.EDU
Subject: Any previous work on space-efficient, time-efficient tries?
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I've found a method of storing tries in constant space per node with
the usual operations (searching down one level, inserting a new node)
running in constant time, independent of the alphabet size. Has this
been done before? I haven't found anything in the usual journals.
---Dan
∂11-Jan-90 0758 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Knights Tour : Proof of Correctness
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 07:58:36 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19403; Thu, 11 Jan 90 07:58:22 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02772; Thu, 11 Jan 90 07:57:53 -0800
Message-Id: <9001111557.AA02772@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1037; Thu, 11 Jan 90 09:55:52 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1017; Thu, 11 Jan 90 09:55:50 CST
Date: Thu, 11 Jan 90 09:55:00 CST
Reply-To: Ajay Shekhawat <ajay%cs.buffalo.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ajay Shekhawat <ajay%cs.buffalo.edu@VM1.NoDak.EDU>
Subject: Knights Tour : Proof of Correctness
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Hi,
I'm looking for a proof of correctness for the
(non-backtracking) Algorithm to solve the Knights Tour Problem. The
algorithm is based on the following rule: "The knight must always be
moved to one of the squares from which there are the fewest exits to
squares not already visited." According to Horowitz & Sahni [1], this
rule was given by J.C. Warnsdorff in 1823. Any references to the proof
of correctness would be greatly appreciated.
Thanks in Advance,
Ajay..
[1] Horowitz, E., & Sahni, S., "Fundamentals of Data Structures",
1983, Comp. Sc. Press, pp. 74.
-------------------------------------------------------------------------------
Ajay Shekhawat < Deptt. of CS , SUNY @ Buffalo , Buffalo , NY 14260 >
ajay@cs.Buffalo.EDU || ajay@sunybcs.BITNET || ajay@sunybcs.UUCP || 716-636-3027
∂11-Jan-90 0758 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Approx. string matching
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 07:58:49 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19407; Thu, 11 Jan 90 07:58:38 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02777; Thu, 11 Jan 90 07:58:28 -0800
Message-Id: <9001111558.AA02777@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1075; Thu, 11 Jan 90 09:56:20 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1059; Thu, 11 Jan 90 09:56:17 CST
Date: Thu, 11 Jan 90 09:55:18 CST
Reply-To: Peter O'Leary <pete%BONNIE.ICS.UCI.EDU@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Peter O'Leary <pete%BONNIE.ICS.UCI.EDU@VM1.NoDak.EDU>
Subject: Approx. string matching
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am attempting to find an efficient approximate string matching
algorithm and so far have had a frustrating time. I have an paper
by Landau and Vishkin from a 1986 ACM Proceedings that describes an
O(kn) algorithm, however, the paper refers to other works that I have not
been able to locate. Does anyone know of a good survey paper or textbook
with a good treatment of this subject?
Peter O'Leary.
∂11-Jan-90 0802 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Models of Lambda Calculus
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 08:02:07 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19522; Thu, 11 Jan 90 08:01:53 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02833; Thu, 11 Jan 90 08:01:26 -0800
Message-Id: <9001111601.AA02833@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1915; Thu, 11 Jan 90 09:59:43 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1891; Thu, 11 Jan 90 09:59:38 CST
Date: Thu, 11 Jan 90 09:58:44 CST
Reply-To: Frank Silbermann <fs%rex.tulane.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Frank Silbermann <fs%rex.tulane.edu@VM1.NoDak.EDU>
Subject: Models of Lambda Calculus
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Denotational semantics for LISP-like functional languages
(e.g. Scheme minus side-effects) typically map program syntax
to an expression in an extended lambda calculus.
Typical extensions include atoms, booleans, sequence constructors,
and delta-conversion rules.
It is understood that such an extended lambda calculus
can be encoded within the pure untyped lambda calculus,
which has as extensional model a domain isomorphic
to its own function space (i.e. the solution to domain
equation "D ~= D->D").
Nevertheless, has the extended lambda calculus ever
been studied in its own right? For instance,
has anyone ever shown the domain
D ~= (Atom + Bools + DxD + D->D)_bottom
to be an extensional model of an extended lambda calculus?
I am especially interested in extensions
to the _untyped_ lambda calculus,
which seems more appropriate for describing languages
like pure Scheme.
I would be grateful to receive references.
Frank Silbermann fs@rex.cs.tulane.edu
∂11-Jan-90 0802 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Max. Indep. Set
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 08:02:42 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19533; Thu, 11 Jan 90 08:02:32 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02838; Thu, 11 Jan 90 08:01:58 -0800
Message-Id: <9001111601.AA02838@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2017; Thu, 11 Jan 90 10:01:08 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1998; Thu, 11 Jan 90 10:00:22 CST
Date: Thu, 11 Jan 90 09:58:55 CST
Reply-To: Robert Levinson <levinson%saturn.ucsc.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Robert Levinson <levinson%saturn.ucsc.edu@VM1.NoDak.EDU>
Subject: Max. Indep. Set
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The following references may help. [3] has the best known approximation
algorithms. I have a polynomial-time algorithm for finding maximum (optimal)
independent sets of graphs that have no oddcycles that share an edge, in
case you are interested.
Bob
[1] \s-2BAR-YEHUDA AND S. EVEN,\s+2 \f2A linear time approximation
algorithm for the weighted vertex cover problem\f1, J. Algorithms,
2(1981), pp. 198-203.
XP
[2] \s-2D. S. HOCHBAUM,\s+2 \f2Approximation algorithms for the
set covering and vertex cover problems\f1, Siam J. Comput.
11, no. 3 (1982), pp. 555-56.
XP
[3] \s-2B. MONIEN, AND E. SPECKENMEYER,\s+2 \f2Some Further Approximation
Algorithms for the Vertex Cover Problem,\f1 Lecture Notes in
Computer Science 159 (1983) pp. 341-9.
XP
[4] \s-2C. SAVAGE\s+2, \f2Depth-First Search and the Vertex
Cover Problem\f1, Information Processing Letters, 14, no. 5, (1982).
Science, Gyor, (Hungary), 1983.
XP
Prof. Robert Levinson
Computer and Information Sciences
Applied Sciences Building
University of California at Santa Cruz
Santa Cruz, CA 95064
(408)459-2087
ARPANET:levinson@cis.ucsc.edu
UUCP:ucbvax!ucsc!saturn!levinson
∂11-Jan-90 0850 LOGMTC-mailer reminder -- seminar today
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker: Timothy G. Griffin, Department of Computer Science, UNICAMP, Brazil
Title: A Formulae-as-Types Notion of Control
Time: Thursday, January 11, 4pm
Place: 252 MJH (Stanford CSD)
∂11-Jan-90 1111 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Parallel complexity reference needed
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 11:11:12 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28136; Thu, 11 Jan 90 11:10:15 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06294; Thu, 11 Jan 90 11:09:21 -0800
Message-Id: <9001111909.AA06294@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6539; Thu, 11 Jan 90 13:06:30 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6499; Thu, 11 Jan 90 13:06:27 CST
Date: Thu, 11 Jan 90 13:04:38 CST
Reply-To: "Paul B. Callahan" <callahan%psuvax1.cs.psu.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Paul B. Callahan" <callahan%psuvax1.cs.psu.edu@VM1.NoDak.EDU>
Subject: Parallel complexity reference needed
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I'm looking for a paper which examines the parallel complexity of
evaluating networks of comparator gates (the basic units of sorting
networks). This is not the same as parallel sorting since arbitrary
networks of comparators may not be sorters. I emphasize this, because
I know there are many references on parallel sorting and I would like
to save readers the trouble of telling me this.
I have been given a vague reference to a paper which conjectures that this
problem is in a complexity class harder than NC but that it is not P-complete.
I have also been told that the same paper shows this problem to be
equivalent to some forms of the stable marriage problem under log space
reductions. However, the only information I've been given is that
this work was done as part of a Stanford Ph.D. dissertation, and appeared
at some conference. After a fairly extensive library search I was unable
to find a paper fitting this description.
For over a month I have been looking at a problem which I can reduce to
lexicographically first maximal (*not* maximum) bipartite matching, which
I was able to reduce to the problem of evaluating a comparator network.
More recently, I was able to prove the converse of this reduction, showing
these problems to be log space equivalent.
Because the paper in question seems to be very close to what I am looking at,
I am interested in seeing any of its related results. In particular,
I would like to see the intuition behind the conjecture that this is
a problem lying somewhere between NC and P-complete. Though I have
had similar intuition, such a claim seems rather bold, and I would be
interested in any convincing arguments.
Thanks for any help.
Paul Callahan
callahan@crabcake.cs.jhu.edu
callahan@psuvax1.cs.psu.edu
∂11-Jan-90 1111 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Help with a reference
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 11:11:38 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28296; Thu, 11 Jan 90 11:10:54 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06340; Thu, 11 Jan 90 11:10:22 -0800
Message-Id: <9001111910.AA06340@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6612; Thu, 11 Jan 90 13:06:54 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6599; Thu, 11 Jan 90 13:06:51 CST
Date: Thu, 11 Jan 90 13:04:59 CST
Reply-To: Ramki Thurimella <ramki%umiacs.UMD.EDU@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ramki Thurimella <ramki%umiacs.UMD.EDU@VM1.NoDak.EDU>
Subject: Help with a reference
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am trying to locate paper by two japanese authors on the subject of
finding a Hamiltonian circuit in a 4-connected planar graphs.
I think the authors are Chiba and Nishizeki, but I am not sure. If any
one has recently noticed this paper, I would greatly appreciate if they
can e-mail me the journal name and the number. I am aware of the paper that
appeared in SICOMP in 1982 by Gouyou-Beauchamps.
Thanks in advance.
Ramakrishna Thurimella
∂11-Jan-90 1148 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU MS in algorithm analysis ?
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 11:47:18 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00703; Thu, 11 Jan 90 11:46:55 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07324; Thu, 11 Jan 90 11:46:46 -0800
Message-Id: <9001111946.AA07324@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6790; Thu, 11 Jan 90 13:10:31 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6776; Thu, 11 Jan 90 13:08:14 CST
Date: Thu, 11 Jan 90 13:06:08 CST
Reply-To: Fridrik Skulason <frisk%rhi.hi.is@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Fridrik Skulason <frisk%rhi.hi.is@VM1.NoDak.EDU>
Subject: MS in algorithm analysis ?
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am posting this for a friend who does not have access to the net. She has
just finished a BS from the University of Iceland and is planning to obtain
a MS degree in the US.
Since one of her major fields of interest is in the area of algorithm analysis,
I would like to hear your opinions on which universities are considered "best"
in this particular field.
Please E-mail the replies to me - don't post to the list.
-frisk
--
Fridrik Skulason University of Iceland
frisk@rhi.hi.is Computing Sevices
Guvf yvar vagragvbanyyl yrsg oynax .................
∂11-Jan-90 1148 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Approx. string matching
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 11:47:12 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00698; Thu, 11 Jan 90 11:46:45 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07317; Thu, 11 Jan 90 11:46:33 -0800
Message-Id: <9001111946.AA07317@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6658; Thu, 11 Jan 90 13:08:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6642; Thu, 11 Jan 90 13:07:24 CST
Date: Thu, 11 Jan 90 13:05:18 CST
Reply-To: John Kececioglu <johnk%arizona.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: John Kececioglu <johnk%arizona.edu@VM1.NoDak.EDU>
Subject: Re: Approx. string matching
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <9001092236.aa13533@PARIS.ICS.UCI.EDU>
Peter O'Leary <pete%BONNIE.ICS.UCI.EDU@VM1.NoDak.EDU> writes:
> I am attempting to find an efficient approximate string matching
> algorithm and so far have had a frustrating time. I have an paper
> by Landau and Vishkin from a 1986 ACM Proceedings that describes an
> O(kn) algorithm, however, the paper refers to other works that I have not
> been able to locate. Does anyone know of a good survey paper or textbook
> with a good treatment of this subject?
There are myriad approximate string matching problems. The two survey papers
I am familiar with are
A. Apostolico and C. Guerra, "The longest common subsequence problem
revisited," Algorithmica 2 (1987) 315-336.
Z. Galil and R. Giancarlo, "Data structures and algorithms for
approximate string matching," J. of Complexity 4 (1988) 33-72.
The only book I know of is
David Sankoff and Joseph Kruskal, editors, _Time Warps, String Edits,
and Macromolecules: The Theory and Practice of Sequence Comparison_,
Addison-Wesley, Reading Massachusetts, 1983.
Eugene Myers has a new practical approximate string matching algorithm with
sublinear expected time, though it is unpublished. If you are interested
in the more restricted problem of finding the edit distance between
two strings, I recommend the following not well-known paper
Eugene Myers, "An O(ND) difference algorithm and its variations,"
Algorithmica 1 (1986) 251-266.
The algorithm described is simple, and has O(D↑2 + N) expected time.
(Here D is the minimum number of single-character insertions, deletions,
and substitutions to convert one string into the other.) An impractical
variation has O(D↑2 + N log N) worst-case time. For implementation issues,
see
Webb Miller and Eugene Myers, "A file comparison program," Software
Practice and Experience 15:11 (November 1985) 1025-1040.
Hope this helps.
--
John Kececioglu
johnk@cs.arizona.edu or arizona!johnk.uucp
Department of Computer Science, University of Arizona, Tucson, Arizona 85721
"Through small apertures we glimpse abysses whose somber depths turn us faint."
∂11-Jan-90 1418 helen@russell.Stanford.EDU Grades
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 14:18:24 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA07722; Thu, 11 Jan 90 14:19:59 PST
Date: Thu 11 Jan 90 14:19:58-PST
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: Grades
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <632096398.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
To: SSP Faculty
>From: Helen
Subject: Fall '89 grades for SSP majors
Looking through the Autumn quarter grades for SSP majors I sense that they're
across the board lower than usual, with more incompletes, NC's, etc. I would
be interested to hear from those of you who taught last quarter whether in
your own courses you observed the same phenomenon. I'm naturally inclined
to blame the earthquake but perhaps there are other factors to be thinking
about.
Thanks,
Helen
-------
∂11-Jan-90 1632 LOGMTC-mailer Seminar time/room change
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 16:32:03 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA09225; Thu, 11 Jan 90 16:34:09 PST
Date: Thu 11 Jan 90 16:34:08-PST
From: John Etchemendy <ETCH@CSLI.Stanford.EDU>
Subject: Seminar time/room change
To: logic@russell.Stanford.EDU, phil-all@russell.Stanford.EDU
Cc: kepa@russell.Stanford.EDU, migura@russell.Stanford.EDU
Message-Id: <632104448.0.ETCH@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
Due to conflicts with everything, we have changed the time of
Philosophy 396, Seminar on Issues in Logical Theory. It will now meet
on Thursday's from 3:45 to 5:30. Due to its size, it is meeting in
the Cordura conference room (100) rather than the Ventura Seminar
room.
Next Thursday's topic will be Chapter IV.10 of the Handbook of
Philosophical Logic: Semantics and the Liar Paradox. Feferman will
present this material. The following Thursday, I will present some of
Barwise and my work on the liar.
If you would like to get future messages about this seminar, and were
not at the first meeting, please send me a message.
John
-------
∂11-Jan-90 1641 LOGMTC-mailer Topic correction
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 16:41:27 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA09273; Thu, 11 Jan 90 16:43:37 PST
Date: Thu 11 Jan 90 16:43:37-PST
From: John Etchemendy <ETCH@CSLI.Stanford.EDU>
Subject: Topic correction
To: logic@russell.Stanford.EDU, phil-all@russell.Stanford.EDU
Cc: kepa@russell.Stanford.EDU, migura@russell.Stanford.EDU
Message-Id: <632105017.0.ETCH@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
On further reflection, the topic of next week's seminar will be:
"Approaches to the Liar Paradox, Part I"
In which will be explained parts of the work by Kripke, Martin and
Woodruff, van Fraassen, Gupta and Herzberger (a little), Aczel,
Feferman, and perhaps others. It will not be tied directly to the
Handbook chapter.
The following week will be:
"Approaches to the Liar Paradox, Part II"
-------
∂11-Jan-90 2227 hellman@isl.Stanford.EDU Admissions
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 11 Jan 90 22:27:47 PST
Received: from isl.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Thu, 11 Jan 90 22:26:30 PST
Received: by isl.Stanford.EDU (3.2/4.7); Thu, 11 Jan 90 22:26:38 PST
Date: Thu, 11 Jan 90 22:26:38 PST
From: hellman@isl.Stanford.EDU (Martin Hellman)
To: ee-faculty@sierra
Subject: Admissions
Cc: kurzweil@sierra
TO: EE Faculty
FROM: Martin Hellman
Associate Dept Chairman for Graduate Admissions
DATE: January 11, 1990
If you meet with a prospective graduate student and are impressed
enough that you want to see his or her folder before the
admissions committee makes a final decision, please put this IN
WRITING or E-mail to Virginia Kurzweil, Director of Graduate
Admissions, McC 168 (kurzweil@sierra).
Every once in a while, we come across a student who says "Prof. X
asked to see my folder." We do not honor such requests from the
student, both to save you from undesired bother (the student
could easily have taken a less interested statement to mean more
than it did) and because, with 1,300 applications to go through
in ten weeks, we need to cut our unnecessary work to a minimum.
By only honoring requests directly from the faculty, we avoid
both problems.
∂12-Jan-90 0831 LOGMTC-mailer seminar
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker:Charles Consel, Yale University (e-mail: consel-charles@cs.yale.edu)
Title: Higher order partial evaluation with data structures
Time: Tuesday, January 16, 11am
Place: 252 MJH (Stanford CSD)
Abstract:
Partial evaluation is a program transformation technique based on
propagating constants, unfolding and specializing functions.
This talk describes our approach to partial evaluation of full
functional languages and the aspects related to self-application. We
illustrate this approach with a partial evaluator for a side-effect
free dialect of Scheme. Our system, named SchismIII, is
self-applicable and handles both higher order functions and data
structures. As such, it extends the class of applications that can be
tackled by self-applicable partial evaluators.
This presentation is an overview of our approach and is illustrated
with concrete examples using SchismIII. It is structured as follows:
(*) Partial evaluation is briefly introduced.
(*) The language of interest is presented.
(*) The phases prior to specialization are described: binding time
analysis and derivation of action trees.
(*) Finally, we describe how action trees are used by the specialization phase.
∂12-Jan-90 0856 eisensee@sierra.STANFORD.EDU Solid State Seminar - AKA EE430
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 12 Jan 90 08:56:11 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Fri, 12 Jan 90 08:54:07 PST
Date: Fri, 12 Jan 90 08:54:07 PST
From: eisensee@sierra.STANFORD.EDU (Sandra K. Eisensee)
To: ee-faculty@sierra, ee-adminlist@sierra, cis-people@glacier
Cc: Iclabusers@glacier
Subject: Solid State Seminar - AKA EE430
Message-Id: <CMM.0.88.632163246.eisensee@>
NEW TIME!
SPECIAL FOR THE NINETIES!
SOLID STATE LAB SEMINAR
AKA EE 430
TIME: 4:00pm REFRESHMENTS
4:15pm TALK STARTS
PLACE: AEL 109
DATE: JANUARY 17, 1990
DR. JUDY HOYT
"Limited Reaction Processing: A Versatile Technique for Fabricating New
Devices"
One of the significant technological developments during the 80's was that of
rapid thermal processing of semiconductors. Limited Reaction Processing (LRP)
is a combination of rapid thermal processing and chemical vapor deposition.
Dr. Hoyt and her colleagues in Professors Gibbons' group have become famous
for their engineering of high performance bipolar transistors using LRP to
grow high quality Si/Si1-xGex films on Si. In this talk Dr. Hoyt will review
the technology and its applications.
R.F.W. Pease
∂12-Jan-90 1046 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Neural Net Course
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jan 90 10:45:58 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02094; Fri, 12 Jan 90 10:45:09 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA29335; Fri, 12 Jan 90 10:42:58 -0800
Message-Id: <9001121842.AA29335@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8001; Fri, 12 Jan 90 12:39:53 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7987; Fri, 12 Jan 90 12:39:50 CST
Date: Fri, 12 Jan 90 12:37:45 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Michael Cohen <mike@bucasb.bu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Michael Cohen <mike%bucasb.bu.edu@VM1.NoDak.EDU>
Subject: Neural Net Course
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
NEURAL NETWORKS:
FROM FOUNDATIONS TO APPLICATIONS
May 6--11, 1989
Sponsored by the Center for Adaptive Systems,
the Graduate Program in Cognitive and Neural Systems,
and the Wang Institute of Boston University
with partial support from
The Air Force Office of Scientific Research
This in-depth, systematic, 5-day course is based upon the world's leading
graduate curriculum in the technology, computation, mathematics, and biology
of neural networks. Developed at the Center for Adaptive Systems (CAS) and
the Graduate Program in Cognitive and Neural Systems (CNS) of Boston
University, twenty-eight hours of the course will be taught by six CAS/CNS
faculty. Three distinguished guest lecturers will present eight hours of
the course.
COURSE OUTLINE
MAY 7, 1990
-----------
---Morning Session (Professor Stephen Grossberg)
Historical Overview, Content Addressable Memory, Competitive Decision Making,
Associative Learning
---Afternoon Session (Professors Michael Jordan (MIT) and Ennio Mingolla)
Combinational Optimization, Perceptrons, Introduction to Back Propagation,
Recent Developments of Back Propagation
MAY 8, 1990
-----------
---Morning Session (Professors Gail Carpenter and Stephen Grossberg)
Adaptive Pattern Recognition, Introduction to Adaptive Resonance Theory,
Analysis of ART 1
---Afternoon Session (Professor Gail Carpenter)
Analysis of ART 2, Analysis of ART 3, Self-Organization of Invariant Pattern
Recognition Codes, Neocognitron
MAY 9, 1990
-----------
---Morning Session (Professors Stephen Grossberg and Ennio Mingolla)
Vision and Image Processing
---Afternoon Session (Professors Daniel Bullock, Michael Cohen, and
Stephen Grossberg)
Adaptive Sensory-Motor Control and Robotics, Speech Perception and Production
MAY 10, 1990
------------
---Morning Session (Professors Michael Cohen, Stephen Grossberg, and
John Merrill)
Speech Perception and Production, Reinforcement Learning and Prediction
---Afternoon Session (Professors Stephen Grossberg and John Merrill and
Dr. Robert Hecht-Nielsen, HNC)
Reinforcement Learning and Prediction, Recent Developments in the
Neurocomputer Industry
MAY 11, 1990
------------
---Morning Session (Dr. Federico Faggin, Synaptics Inc.)
VLSI Implementation of Neural Networks
TO REGISTER: By phone, call (508) 649-9731; by mail, write for further
information to: Neural Networks, Wang Institute of Boston University,
72 Tyng Road, Tyngsboro, MA 01879. For further information about registration
and STUDENT FELLOWSHIPS, see below.
REGISTRATION FEE: Regular attendee--$950; full-time student--$250.
Registration fee includes five days of tutorials, course notebooks, one
reception, five continental breakfasts, five lunches, four dinners, daily
morning and afternoon coffee service, evening discussion sessions.
STUDENT FELLOWSHIPS supporting travel, registration, and lodging for the
Course are available to full-time graduate students in a PhD program.
Applications must be postmarked by March 1, 1990. Send curriculum vitae,
a one-page essay describing your interest in neural networks, and a letter
from a faculty advisor to: Student Fellowships, Neural Networks Course,
Wang Institute of Boston University, 72 Tyng Road, Tyngsboro, MA 01879.
∂12-Jan-90 1120 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for Papers -- Neural Networks for Automatic Target
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jan 90 11:20:07 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05253; Fri, 12 Jan 90 11:19:31 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00119; Fri, 12 Jan 90 11:18:57 -0800
Message-Id: <9001121918.AA00119@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8035; Fri, 12 Jan 90 12:40:16 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8020; Fri, 12 Jan 90 12:40:13 CST
Date: Fri, 12 Jan 90 12:38:04 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Michael Cohen <mike@bucasb.bu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Michael Cohen <mike%bucasb.bu.edu@VM1.NoDak.EDU>
Subject: Call for Papers -- Neural Networks for Automatic Target
Recognition
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
NEURAL NETWORKS FOR AUTOMATIC TARGET RECOGNITION
MAY 11--13, 1990
Sponsored by the Center for Adaptive Systems,
the Graduate Program in Cognitive and Neural Systems,
and the Wang Institute of Boston University
with partial support from
The Air Force Office of Scientific Research
This research conference at the cutting edge of neural network science and
technology will bring together leading experts in academe, government, and
industry to present their latest results on automatic target recognition
in invited lectures and contributed posters. Invited lecturers include:
JOE BROWN, Martin Marietta, "Multi-Sensor ATR using Neural Nets"
GAIL CARPENTER, Boston University, "Target Recognition by Adaptive
Resonance: ART for ATR"
NABIL FARHAT, University of Pennsylvania, "Bifurcating Networks for
Target Recognition"
STEPHEN GROSSBERG, Boston University, "Recent Results on Self-Organizing
ATR Networks"
ROBERT HECHT-NIELSEN, HNC, "Spatiotemporal Attention Focusing by
Expectation Feedback"
KEN JOHNSON, Hughes Aircraft, "The Application of Neural Networks to the
Acquisition and Tracking of Maneuvering Tactical Targets in High Clutter
IR Imagery"
PAUL KOLODZY, MIT Lincoln Laboratory, "A Multi-Dimensional ATR System"
MICHAEL KUPERSTEIN, Neurogen, "Adaptive Sensory-Motor Coordination
using the INFANT Controller"
YANN LECUN, AT&T Bell Labs, "Structured Back Propagation Networks for
Handwriting Recognition"
CHRISTOPHER SCOFIELD, Nestor, "Neural Network Automatic Target Recognition
by Active and Passive Sonar Signals"
STEVEN SIMMES, Science Applications International Co., "Massively Parallel
Approaches to Automatic Target Recognition"
ALEX WAIBEL, Carnegie Mellon University, "Patterns, Sequences and Variability:
Advances in Connectionist Speech Recognition"
ALLEN WAXMAN, MIT Lincoln Laboratory, "Invariant Learning and
Recognition of 3D Objects from Temporal View Sequences"
FRED WEINGARD, Booz-Allen and Hamilton, "Current Status and Results of Two
Major Government Programs in Neural Network-Based ATR"
BARBARA YOON, DARPA, "DARPA Artificial Neural Networks Technology
Program: Automatic Target Recognition"
CALL FOR PAPERS---ATR POSTER SESSION: A featured poster session on ATR
neural network research will be held on May 12, 1990. Attendees who wish to
present a poster should submit 3 copies of an extended abstract
(1 single-spaced page), postmarked by March 1, 1990, for refereeing. Include
with the abstract the name, address, and telephone number of the corresponding
author. Mail to: ATR Poster Session, Neural Networks Conference, Wang
Institute of Boston University, 72 Tyng Road, Tyngsboro, MA 01879. Authors
will be informed of abstract acceptance by March 31, 1990.
SITE: The Wang Institute possesses excellent conference facilities on a
beautiful 220-acre campus. It is easily reached from Boston's Logan
Airport and Route 128.
REGISTRATION FEE: Regular attendee--$90; full-time student--$70.
Registration fee includes admission to all lectures and poster session,
abstract book,
one reception, two continental breakfasts, one lunch, one dinner, daily
morning and afternoon coffee service. STUDENTS FELLOWSHIPS are available.
For information, call (508) 649-9731.
TO REGISTER: By phone, call (508) 649-9731; by mail, write for further
information to: Neural Networks, Wang Institute of Boston University, 72 Tyng
Road, Tyngsboro, MA 01879.
∂12-Jan-90 1121 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU DISO 90
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jan 90 11:21:29 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05332; Fri, 12 Jan 90 11:20:53 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00140; Fri, 12 Jan 90 11:19:34 -0800
Message-Id: <9001121919.AA00140@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8091; Fri, 12 Jan 90 12:41:56 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8074; Fri, 12 Jan 90 12:41:10 CST
Date: Fri, 12 Jan 90 12:38:26 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Hong Chen <hongch@sbcs.sunysb.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Hong Chen <hongch%sbcs.sunysb.edu@VM1.NoDak.EDU>
Subject: DISO 90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
International Symposium on Design and Implementation of
Symbolic Computations Systems (DISCO'90)
April 10 - 12, 1990 Capri, Italy
PRELIMINARY PROGRAM
SAC - Systems Design
J. Davenport (University of Bath, England)
Current Main Problems in Computer Algebra Systems Design
(Invited)
G. Butler, J. Cannon
The Design of Cayley - a Language for Modern Algebra
A. Giovini, G. Niesi
CoCoA: a User-Friendly System for Commutative Algebra
A. Galligo, J. Grimm, L. Pottier
The Design of SISYPHE: A System for Doing Symbolic and Algebraic Computations
J.H. Davenport, B.M. Trager
Scratchpad's View of Algebra I: Commutative Algebra
M. Clarkson
Praxis: A Rule-Based Expert System for Macsyma (*)
A.V. Bocharov
Will DELiA Grow into an Expert System? (*)
C. Bajaj, A. Royappa
GANITH: An Algebraic Geometry Package (*)
SAC - Implementation Methods and Techniques
A. Fortenbacher
Efficient Type Inference and Coercion in Computer Algebra
C. Limongelli, M.B. Mele, M. Regio, M. Temperini
Abstract Specification of Mathematical Structures and Methods
U. Petermann
Programming Paradigms for Symbolic Computation Systems -
Analysis of an Example
H. Kredel
Operator Overloading and Type Resolution in
Mas Modula-2 Algebra System (*)
D. Constales
Prototypes for the Automatic Translation of
Computer Algebra Languages (*)
J.P. Vidal
The Computation of Groebner Bases on
a Shared Memory Multiprocessor
K.H. Lee, K.S. Leung, S.M. Cheang
The Implementation of a PC-Based List Processor
for Symbolic Computation (*)
Automated Reasoning
A. Bundy (University of Edinburgh, Scotland)
The Use of Proof Plans in Formal Methods (Invited)
M.E. Stickel
A Prolog Technology Theorem Prover:
A New Exposition and Implementation in Prolog
J.L. Lassez
Parametric Queries, Linear Constraints and Variable Elimination
M. Adi, C. Kirchner
AC-Unification Race: the System Solving Approach and its Implementation
S. Anantharaman, N. Andrianarivelo
Heuristical Criteria in Refutational Theorem Proving
S. Costantini, P. Dell'Acqua, G.A. Lanzarone
Reflective Prolog: Design and Implementation (*)
F. Baj, M. Bruschi, A. Zanzi
Design and Development of ENprover,
an Automated Theorem Proving System Based on EN-Strategy (*)
G. Forcellese, M. Temperini
Towards a Logic Language:
an Object-Oriented Implementation of the Connection Method (*)
Software Environments and Languages
G. Attardi (University of Pisa, Italy)
Requirements for Standards in Knowledge Base Systems (Invited)
M.C. Dewar, M.G. Richardson
Reconciling Symbolic and Numeric Computation in a Practical Setting
M. Bidoit, F. Capy, C. Choppy
The Design and Specification of the ASSPEGIQUE Database
S.V. Chmutov E.A. Gaydar, I.M. Ignatovich, V.F. Kozadoy,
A.P. Nemytykh, V.A. Pinchuk
Implementation of the Symbol Analytic Transformations Language
FLAC (*)
M. Hanus
A Functional and Logic Language with Polymorphic Types
V. Russi, R. Zompi
Graphical Object Oriented Executable Specification for
an Automation Oriented Paradigm of Software Development
R. Avitzur
Suggestions for a Friendlier User Interface (*)
N. Kajler
Building Graphic User Interfaces for Computer Algebra Systems
P.S. Wang
A System Independent Graphing Package for Mathematical Functions
G.P. Faconti, R.D. Bettarini, F. Patern\'{o}
A Model of Interaction for Graphical Systems
Theory
G. Huet (INRIA, Rocquencourt, France)
Design Issues for a Computer-Aided Environment for
Constructive Mathematics (Invited)
C. Talcott
A Theory for Program and Data Type Specification
R. Hennicker
Context Induction: A Proof Principle for Behavioural Abstractions
J.P. Jouannaud, C. March\'{e}
Completion Modulo Associativity, Commutativity and Identity (AC1)
T.W. Fr\"{u}hwirth
Polymorphic Type Checking with Subtypes in Prolog
R.N. Bol, K.R. Apt, J.W. Klop
On the Power of Subsumption and Context Checks
J.C. Reynaud
Putting Algebraic Components Together: a Dependent Type Approach
(*) Short Presentation of Extended Abstracts
For further information on DISCO'90, please contact the Symposium Chairman:
Prof. Alfonso Miola,
Dipartimento di Informatica e Sistemistica,
Universita' di Roma "La Sapienza",
Via Buonarroti 12, 00185 Roma Italy.
Fax: (+39) - 6 -734616
Tel. (+39) -6 - 7312367 / 7312328 / 733412
DISCO 90 Special Session on Symbolic System Projects.
At DISCO 90 we will also organize a special session
for implementors of systems. The objectives of this session are
quick overview on the current state of symbolic systems projects
world-wide,
exchange of ideas, expertise, experiences,
tentative planning of cooperations between groups and individuals,
exchange of working software and sytem parts,
discussion of strategies for fund raising, promotion, marketing,
separation between scientific and commercial symbolic software etc.
Each project will give a 5 to 10-min. presentation
(no more than 2-4 slides!). A typical presentation should consist of
features and goals of the project
achievements and current state
next steps, future plans
offers and request for cooperation
An open-ended discussion session will follow the presentations.
We invite all groups and projects to participate in this exciting event.
For optimal preparation of the session we would like to receive
a 1-2 page abstract of your presentation and
name and address (phone, FAX, e-mail) of a contact person.
Please send this information at your earliest convenience to one of the
following persons.
Professor Paul Wang, Dept. of Mathematics and Computer Science,
Kent State Univ. Kent Ohio, 44242 USA (pwang@ma-cs.kent.edu)
Dr. Franz Winkler, University of Linz, RISC
Institute, A4040 Linz, Austria (Europe), (bitnet: k310270@AEARN)
These abstracts will also be published in a regular issue of the SIGSAM
Bulletin. We aim at a complete picture of the current state on symbolic
software activities in the world.
Therefore, your participation in this event is crucial and we
hope that your group will be represented. You are also encouraged to
bring demos of your system. The organizers are exploring the possibility
of making several popular workstations available on site.
We look forward to hearing from you and to seeing you at DISCO 90 in Capri.
∂12-Jan-90 1124 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGUCCS CALL for PARTICIPATION
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jan 90 11:24:37 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05465; Fri, 12 Jan 90 11:23:58 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00185; Fri, 12 Jan 90 11:21:25 -0800
Message-Id: <9001121921.AA00185@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8166; Fri, 12 Jan 90 12:42:25 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8154; Fri, 12 Jan 90 12:42:01 CST
Date: Fri, 12 Jan 90 12:40:29 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Amin Shafie - Univ of Cincinnati Comp Ctr
<SHAFIE@UCBEH.SAN.UC.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Amin Shafie - Univ of Cincinnati Comp Ctr
<SHAFIE@UCBEH.SAN.UC.EDU>
Subject: SIGUCCS CALL for PARTICIPATION
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
<--------------------------------------------------------------------
<
< SIGUCCS User Services Conference XVIII
< Call For Participation
<
< New Centerings in Computing Services
<
< September 30 through October 3, 1990
<
< Westin Hotel
< Cincinnati, Ohio
<
<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<
<<Attention Directors, Managers, Analysts, Consultants, Programmers,
<<Technical Writers, Trainers, and Librarians!
<<
<<The higher education computing scene in the 1990s will present exciting
<<challenges. To accommodate users' needs, computing service organizations
<<are now visibly transforming in function and structure. The widespread
<<adoption of personal computing by all disciplines, the increasing demand
<<for desktop access to shared resources, the growth in demand for
<<supercomputing capabilities, and the proliferation of powerful desktop
<<workstations exert irresistible forces on central computing services.
<<In response, the central site grows exponentially in staff and machinery
<<at one academic institution; at another, the computing center is disbanded
<<to provide distributed computing! At some sites increasing specialization
<<is urged; at others, generalization is required. Regardless of the
<<transforming strategy adopted by an individual institution, one fact
<<seems clear: the user is the center toward which all computing services
<<are directed.
<<
<<SIGUCCS '90 invites you to participate in the examination and discussion
<<of the myriad challenges facing user services professionals as we enter a
<<new decade and of the new centerings computing service organizations are
<<discovering to meet them. Please join us!
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<You can Participate
<<
<< Presentations
<<
<< Papers
<<
<< Panel Discussions
<<
<< Quick Workshops
<<
<< Educational Materials Competition
<<
<< Newsletter Competition
<<
<< Technical Writing Competition
<<
<< Documentation Display
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<
<<
<<Important Dates
<<
<< March 1, 1990 Presentation proposals due
<< April 1, 1990 Notification of proposal acceptance
<< May 1, 1990 Final Papers due
<< June 1, 1990 Newsletter entries due
<< June 1, 1990 Technical writing entries due
<< June 15, 1990 Notification of paper/panel acceptance
<< September 1, 1990 Deadline for materials for
<< documentation display
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<Presentation Topic Areas
<<
<<
<<Information Exchange Technology
<<
<<Information exchange may well be the most important computing
<<activity of the 1990s. The infrastructure for information delivery, the
<<National Research and Academic Network (NREN), is presently being developed.
<<How do we meet the challenges of a world where the
<<facilitation of information delivery may be a principal user services
<<responsibility? Topics of particular interest include:
<<
<< new approaches to information exchange
<<
<< campus activity in implementing information exchange
<< facilities that comply with emerging international standards
<<
<< research and development of computer-mediated information
<< exchange methods
<<
<<
<<Distributed Services
<<
<<As the role of user services shifts to providing distributed support,
<<we must create new ways of providing traditional services as well as
<<designing new services. Topics of particular interest include:
<<
<< providing support staff in departments and colleges
<<
<< funding issues
<<
<< if and how to charge back for services
<<
<< human networking of distributed support staff
<<
<< nonlabor-intensive support strategies
<<
<< cooperative efforts with other departments
<<
<<
<<
<<Management Strategies
<<
<<How do user services managers cooperate with other administrative and
<<academic units that use or provide computing resources? How do they
<<meet the many and diverse demands? Topics of particular interest include:
<<
<< reorganization
<<
<< interaction with faculty advisory groups
<<
<< delegating and distributing responsibility
<<
<< coordinating university computing resources
<<
<< staff professional development
<<
<<
<<Marketing your Services
<<
<<Changing roles may require changing your services and, often, your image on
<<campus as you provide new services to new users. Topics of particular in-
<<terest include:
<<
<< promotional strategies
<<
<< conducting market research
<<
<< designing services for unique or special audiences
<<
<<
<<
<<Strategies for Small Schools
<<
<<How can a small liberal arts college have distributed user services and
<<centralized user services? How do distributed and centralized services work
<<together to provide computing services beyond word processing? The
<<sciences have become computer literate; now, how do we reach out from the
<<center to the humanities and fine arts? Are we getting out of the
<<office and into the trenches? Are we making too many "house calls"?
<<Should we make them at all?
<<
<<
<<Security and Ethics
<<
<<As electronic mail and conferencing become more popular, computing
<<systems are widely accessible to more users. How secure should academic
<<computing resources be? What are the ethical guidelines provided for users
<<of electronic mail and conferencing systems? Topics of particular interest
<<include:
<<
<< promoting responsible and ethical use of computing resources
<<
<< security strategies
<<
<< adopting an ethics policy
<<
<<
<<Serving New Audiences
<<
<<People from the humanities, the arts, and other traditionally nontechnical
<<disciplines are discovering that computers can help in areas other than
<<word processing. In an increasingly proactive stance in the central
<<computing facility, what do we do to attract and support these new audi-
<<ences? Topics of interest include:
<<
<< providing information about off-the-shelf specialized
<< programs for music, fine arts, and the humanities
<<
<< facilitating technical support of nontraditional areas
<<
<< serving the computing beginner who wants to do
<< sophisticated tasks
<<
<<
<<Consulting, Training, and Documentation
<<
<<Supporting those who use the computing resources that we provide re-
<<mains an important responsibility of user services organizations. Topics
<<of particular interest include:
<<
<< new approaches to training
<<
<< providing distributed consulting
<<
<< documentation distribution services
<<
<<
<<and/or other topics that would be of interest to your national
<<and international colleagues
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<Submitting Proposals
<<
<<
<<Submit proposals via electronic mail to:
<<
<< SIGPAPER@OHSTVMA.BITNET or
<<
<< SIGPAPER@OHSTVMA.IRCC.OHIO-STATE.EDU
<<
<<If you do not have access to electronic mail, send a printed copy to:
<<
<< Susan Jenkins Saari
<< Instruction and Research
<< Computer Center
<< The Ohio State University
<< 1971 Neil Avenue
<< Columbus, OH 43210
<<
<< phone: (614) 292-4843
<< fax: (614) 292-7081
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<Accepted Proposals
<<
<<
<<Proposals must be received by March 1, 1990. Any submisson received
<<after this date will not be considered by the Program Committee. You will
<<be notified of the Program CommitteeUs decision by April 1, 1990. If your
<<proposal is accepted, you will be asked to submit a full paper by May 1,
<<1990. Any papers received after this date will not be considered. You will
<<be notified of the Program CommitteeUs decision by June 15, 1990.
<<
<<If your presentation is accepted, SIGUCCS is depending on you. If you are
<<ker to make your presentation (not a substitute presentation).
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<
<<How to Participate
<<
<<
<<Proposals
<<
<<For each proposal, include your name, title, affiliation, mailing ad-
<<type of proposal (presentation or panel discussion) and its topic area.
<<In addition, you must enclose the proper materials from the following
<<requirements list:
<<
<<Description
<<
<<Papers Papers will be presented in 20-minute ntervals, with
<< three papers scheduled per 90-minute session. Speakers'
<< papers will be published in the conference proceedings.
<<
<<Panels Panels will be in-depth treatments of a single topic by
<< two to four speakers from at least two different schools,
<< coordinated by a moderator. Allow ample time for audience
<< discussion. Abstracts for panels should be submitted
<< as a unit by the person who wishes to act as a moderator.
<< Panelists' papers will be published in the conference
<< proceedings.
<<
<<Quick Workshops Quick workshops provide 90-minute overviews of new technolo-
<< gies, innovative applications, and creative strategies
<< for addressing the needs of computer users on campus.
<<
<<
<<Requirements
<<
<<Papers A 250- to 300-word abstract of the paper. Acceptance of
<< a proposal does not automatically ensure acceptance
<< of a paper for presentation; you must submit a full
<< paper to be considered for the conference program.
<<
<<Panels A 250- to 300-word description of the panel, including
<< each panelist's name, title, affiliation, and presentation
<< topic. Acceptance of a panel description does not
<< automatically ensure acceptance of the panel for
<< presentation; each panelist must submit a full paper
<< to be considered for the conference program.
<<
<<Quick Workshops A one- to two-page outline of the presentation and a
<< 10-minute videotape excerpt from the proposed presentation.
<< Acceptance of a proposal does not automatically ensure
<< acceptance of a workshop for presentation; you must
<< submit a full paper to be considered for the conference
<< program. Only three or four presentations will be a
<< ccepted in this category because it is highly competiive.
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<
<<Other Ways to Participate
<<
<<Education and Training Materials Competition
<<
<<Interest in and the importance of user education and training have grown
<<with each SIGUCCS conference. The 1990 SIGUCCS Conference offers,
<<for the first time, competition for user education and training materials for
<<colleges and universities.* We invite you to submit no more than two
<<entries in any or all of the following categories: curriculum catalog, class-
<<room printed materials, or self-contained printed tutorials. Although the
<<first year of this competition includes only printed materials, we would like
<<to know if there is an interest in expanding our future competitions to
<<include video, audio, and computer-based tutorials. Deadline for entry is
<<June 1, 1990. For more details and an entry form, or to address the issue
<<of future competition categories, contact:
<<
<< Diane Jung-Gribble
<< Indiana University
<< 750 North State Road 46 Bypass
<< Bloomington, IN 47405
<<
<< (812) 855-0962
<<
<<
<< JUNG@IUBACS.BITNET
<< JUNG@JADE.BACS.INDIANA.EDU
<<
<<*NOTE: this competition is not open to commercial materials
<<
<<Newsletter Competition
<<
<<Winning an award in the SIGUCCS Newsletter Competition is a mark of
<<distinction for your institution, and for your editors, writers,artists,and
<<designers. You will be asked to submit two consecutive issues published
<<between June 1989 and May 1990. Deadline for entry is June 1, 1990.
<<For more details and an entry form, contact:
<<
<< Jess Anderson
<< Madison Academic Computing Center
<< University of Wisconsin-Madison
<< 1210 West Dayton Street
<< Madison, WI 53706
<<
<< (608) 263-6988
<<
<< ANDERSON@MACC.WISC.EDU
<< ANDERSON@WISCMACC.BITNET
<<
<<
<<Technical Writing Competition
<<
<<If you have written or published a particularly good article in a computing
<<newsletter, enter it in the Technical Writing Competition. Each computing
<<center may enter one article. Deadline for entry is June 1,1990. To obtain
<<entry forms and more details, contact:
<<
<< Donald J. Montabana
<< University of Pennsylvania
<< Computing Resources Center
<< 1202 Blockley Hall
<< Philadelphia, PA 19104-6021
<<
<< (215) 898-9085
<<
<< MONTABANA@A1.RELAY.UPENN.EDU
<<
<<
<<
<<Documentation Display
<<
<<The documentation room will feature an online system for submitted
<<documentation. Conference attendees who have BITNET or INTERNET
<<access will be able to email documentation to their university or college.
<<Documentation may be submitted electronically to DOCUMENT@MIAMIU,
<<by hardcopy, or diskette (IBM or Mac formatted) and must be received
<<before September 1, 1990. Direct inquries to:
<<
<< Al Kaled
<< Academic Computing Services
<< Miami University
<< Oxford, OH 45056
<<
<< (513) 529-6226
<<
<< AK75STAF@MIAMIU
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<
<<More Information
<<
<<
<<General Information
<
<<Amin Shafie, Conference Chair
<<University of Cincinnati
<<
<<
<< e-mail: SHAFIE@UCBEH.BITNET
<<
<< phone: (513) 556-9001
<<
<< fax: (513) 556-0035
<<
<<
<<Call for Participation
<<Susan Jenkins Saari, Program Chair
<<The Ohio State University
<<
<< e-mail: SIGPAPER@OHSTVMA.BITNET
<<
<< phone: (614) 292-4843
<<
<< fax: (614) 292-7081
<<
<<
<<Registration
<<Ken Maccarone, Registration Chair
<<University of Cincinnati
<<
<< e-mail: MACCARON@UCBEH.BITNET
<<
<<
<< phone: (513) 556-9098
<< fax: (513) 556-0035
<<
<<
<<>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
<<
<<
<<ACM SIGUCCS
<<
<<The Association of Computing Machinery's (ACM) Special Interest Group
<<for University and College Computing (SIGUCCS) is one of ACM's
<<organizational units devoted to the technical activities of its members.
<<SIGUCCS provides a link for guidance and the interchange of ideas among
<<computing professionals in the full range of small to large institutions.
<<Its newsletter, annual conferences, and workshops promote the discussion
<<of mutual problems. networks, user services, and computer center management.
<<This SIGUCCS conference emphasizes practical ways to improve services for
<<those who use university and college computing centers.
Amin Shafie
Assistant Director
Academic Computing Services UCBEH::SHAFIE
University of Cincinnati SHAFIE@UCBEH.SAN.UC.EDU
ML 088 SHAFIE@UCBEH.BITNET
Cincinnati, Ohio 45221
(513) 556-9022
∂12-Jan-90 1452 hemenway@Sunburn.Stanford.EDU First Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jan 90 14:51:07 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22938; Fri, 12 Jan 90 14:50:04 -0800
Date: Fri, 12 Jan 1990 14:50:03 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: First Meeting
Message-Id: <CMM.0.88.632184603.hemenway@Sunburn.Stanford.EDU>
The first meeting of the PhD admissions committee will be on Tuesday,
Jan. 30 at 2:30 pm in MJH 252. At this meeting we'll talk about
procedures, scheduling and philosophy for the forth-coming admission
season. We expect that we'll have the first packets available for
reading on either Friday, Feb. 1 (due back on Monday) or Monday, the
5th (due back that Thursday). Needless to say, we're certainly aiming
for the first option but must await the arrival of the December GRE
scores before we can know for sure.
We hope to see you all on the 30th. I'd expect the meeting to last
around an hour or perhaps just a bit more.
Sharon
∂14-Jan-90 1028 grundy@csli.Stanford.EDU The Symbolic Systems Forum (New time and place)
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Jan 90 10:28:11 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA16900; Sun, 14 Jan 90 10:23:29 PST
Date: Sun 14 Jan 90 10:23:28-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: The Symbolic Systems Forum (New time and place)
To: grundy@csli.Stanford.EDU
Message-Id: <632341408.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, January 18, 1990
Building 60, Room 62-A, 4:15 pm
*************************************************************
IMPORTANT NOTE: The Symbolic Systems Forum will be meeting
at a new time and a new place this quarter. We hope that
meeting on Thursdays at 4:15 pm will allow more people to
attend. If you have comments about the time change, please
address them to the forum chair, Jennifer Cotteleer
(jac@jessica). The new room, 60-62A, is on the second floor
of building 60.
*************************************************************
Speaker: Prof. Jim Greeno
Topic: "Affordances for Reasoning"
ABSTRACT
--------
General concepts are often equated with their abstract
representations, but a representation doesn't provide
generality unless it is interpreted successfully. An
example is the concept of linear functions, studied in high
school algebra, which is often taught in a real life version
of Searle's "Chinese Room." I'll report progress on some
research on situated reasoning about linear functions,
present a theory about how the situation supports the
reasoning, and describe a study about linear equations in
this setting.
-------
∂14-Jan-90 1933 LOGMTC-mailer Talks Tuesday
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Jan 90 19:32:54 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14788; Sun, 14 Jan 90 19:33:15 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA02247; Sun, 14 Jan 90 19:16:05 PST
Message-Id: <9001150316.AA02247@iswim.stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: Talks Tuesday
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Sun, 14 Jan 90 19:16:04 PST
Sender: jcm@iswim.Stanford.EDU
There will be three POPL-related talks on Tues.
Carolyn Talcott is hosting the first.
The other two are
Phil Wadler of Glasgow University at 3 PM on comprehending monads, and
Harry Mairson of Brandeis at 4 PM on the complexity of ML type inference
Abstracts follow. Rooms will be announced.
-------------------
Phil Wadler
Comprehending Monads.
Category theorists invented {\em monads} in the 1950's to concisely
express certain aspects of universal algebra. Functional programmers
invented {\em list comprehensions} in the 1970's to concisely express
certain programs involving lists. This talk shows how list
comprehensions may be generalised to an arbitrary monad, and how the
resulting programming feature can concisely express in a pure
functional language concepts such as manipulating state, updating
arrays destructively, handling exceptions, or parsing. This builds on
Moggi's work that uses monads to describe semantics. Like Gifford and
Lucassens's {\em effect systems}, monads use the type system to
describe what effects a program may have; unlike effect systems, they
yield pure (referentially transparent) functional programs. No
knowledge of category theory is assumed.
-----------
Deciding ML Typability is Complete for Deterministic
Exponential Time
Harry G. Mairson
Department of Computer Science
Brandeis University
Waltham, Massachusetts 02254
ABSTRACT:
A well known but incorrect piece of functional programming folklore is
that ML expressions can be efficiently typed in polynomial time. In
probing the truth of that folklore, various researchers, including
Wand, Buneman, Kanellakis, and Mitchell, constructed simple
counterexamples consisting of ML programs whose principal types grow
superpolynomially. The folklore was even more strongly contradicted
by the recent result of Kanellakis and Mitchell that simply deciding
whether or not an ML expression is typable is PSPACE-hard.
We improve the latter result, showing that deciding ML typability is
DEXPTIME-hard. Since Kanellakis and Mitchell have shown containment
in DEXPTIME, the problem is DEXPTIME-complete. The proof of
DEXPTIME-hardness is carried out via a generic reduction: it consists
of a very straightforward simulation of any deterministic one-tape
Turing machine $M$ with input $x$ running in $O(c↑{|x|})$ time by a
polynomial-sized ML formula $\Phi_{M,x}$, such that $M$ accepts $x$
iff $\Phi_{M,x}$ is typable. It is purely the expressive power of ML
polymorphism to succinctly express function composition which results
in a proof of DEXPTIME-hardness. We conjecture that stronger lower
bounds for extensions to the ML typing system can be regarded
precisely in terms of this expressive capacity for succinct function
composition.
It may come as a shock to some more practical functional programming
language enthusiasts that this rather esoteric lower bound {\em is
just a computer program}, where we are interested in the {\em type}
produced by the program instead of the {\em value}. As in any good
program or proof, we have tried to use modularization and data
abstraction to make it more understandable.
This talk should be understandable to anyone who understands the
mechanics of ML let-polymorphism, and knows what a Turing Machine is.
It should be of interest to programming language theorists,
functional programming enthusiasts, as well as those interested in
software engineering, automatic type inference, and type checking.
∂15-Jan-90 1921 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU AFLB this week
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jan 90 19:21:51 PST
Received: from wolvesden.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18294; Mon, 15 Jan 90 19:19:06 -0800
Received: by wolvesden.Stanford.EDU (5.61 (wolvesden 9/7/89)/inc-1.01)
id AA09141; Mon, 15 Jan 90 19:18:39 -0800
Message-Id: <9001160318.AA09141@wolvesden.Stanford.EDU>
To: aflb-all@neon.stanford.edu
Subject: AFLB this week
Date: Mon, 15 Jan 90 19:18:37 PST
From: Alexander Wang <axwang@wolvesden.Stanford.EDU>
The first AFLB of the quarter will be this Thursday, January 18, in
MJH 252 at the new time of 12:00pm. The speaker this week will be
Seffi Naor.
Small-bias probability spaces: efficient constructions and appli-
cations.
Seffi Naor
We show how to efficiently construct a small probability space on
$n$ binary random variables such that for every subset, its pari-
ty is either zero or one with ``almost" equal probability. They
are called $epsilon$-biased random variables. The number of ran-
dom bits needed to generate the random variables is $O(log n +
log {1/epsilon})$. Thus, if $epsilon$ is polynomially small,
then the size of the sample space is also polynomial.
$epsilon$-biased random variables can be used to construct "al-
most" $k$-wise independent random variables where $epsilon$ is a
function of $k$.
These probability spaces have various applications:
(1) Derandomization of algorithms: many randomized algorithms
that require only $k$-wise independence of their random bits
(where k is O(log n)$), can be derandomized by using $epsilon$-
biased random variables.
(2) Reducing the number of random bits required by certain ran-
domized algorithms, e.g., verification of matrix multiplication.
(3) Exhaustive testing of combinatorial circuits. We provide the
smallest known family for such testing.
(4) Communication complexity: two parties can verify equality of
strings with high probability exchanging only a logarithmic
number of bits.
(5) Hash functions: we can construct a polynomial sized family of
hash functions such that with high probability, the sum of a ran-
dom function over two different sets is not equal.
This is joint work with Moni Naor.
∂16-Jan-90 0903 LOGMTC-mailer seminar reminder
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker:Charles Consel, Yale University (e-mail: consel-charles@cs.yale.edu)
Title: Higher order partial evaluation with data structures
Time: Tuesday, January 16, 11am
Place: 252 MJH (Stanford CSD)
∂16-Jan-90 1112 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGACT News reminder
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Jan 90 11:12:08 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23245; Tue, 16 Jan 90 11:11:37 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11655; Tue, 16 Jan 90 11:10:18 -0800
Message-Id: <9001161910.AA11655@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2203; Tue, 16 Jan 90 13:07:26 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2186; Tue, 16 Jan 90 13:07:24 CST
Date: Tue, 16 Jan 90 13:06:34 CST
Reply-To: Mike Langston <langston%cs.utk.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Mike Langston <langston%cs.utk.edu@VM1.NoDak.EDU>
Subject: SIGACT News reminder
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The deadline for the Winter 1990 issue is February 1.
As always, late contributions will not be permitted to
delay printing and distribution. Thus, if you have an
item you would like to submit for possible publication
in the News, please do so without delay.
Electronic submissions (in LaTeX) are preferred.
Mike Langston
Dept of Computer Science
Univ of Tennessee
Knoxville, TN 37996-1301
(615) 974-4399
langston@cs.utk.edu
∂16-Jan-90 1114 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU summary of replies to query about fp PhD programs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Jan 90 11:14:08 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23357; Tue, 16 Jan 90 11:13:43 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11743; Tue, 16 Jan 90 11:11:51 -0800
Message-Id: <9001161911.AA11743@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2245; Tue, 16 Jan 90 13:07:44 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2230; Tue, 16 Jan 90 13:07:41 CST
Date: Tue, 16 Jan 90 13:06:48 CST
Reply-To: David Cabana <drc%beach.cis.ufl.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: David Cabana <drc%beach.cis.ufl.edu@VM1.NoDak.EDU>
Subject: summary of replies to query about fp PhD programs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I recently asked for recommendations of PhD programs in the U.S. with
a strong functional programming emphasis. I was gratified and almost
overwhelmed by the generosity of your responses. I want to thank all
of you who responded. I apologize for not thanking each of you
personally, but I have received almost 100 kbytes of response. Instead,
I will summarize the recommendations, as several people have asked me to.
My summary will consist simply of enumerating the schools mentioned.
I have prepared a longer summary consisting of excerpts from the mail
I received. I will gladly send this to anyone who directly requests
it.
In no particular order, the schools were:
Oregon Graduate Institute of Science and Technology
Cornell University.
University of Pennsylvania
University of Indiana
Yale University
UNC Chapel Hill
MIT
Arizona State
SUNY at Stony Brook
Tulane University
CMU
Stanford
Princeton
Northeastern University
Rutgers
Rice
Boston University
Kansas State University
Yale, OGI, CMU and Cornell were mentioned most frequently, for
whatever it's worth.
Thanks again,
David Cabana
--
David Cabana
drc@beach.cis.ufl.edu
UUCP: ...!gatech!uflorida!beach.cis.ufl.edu!drc
∂16-Jan-90 1518 LOGMTC-mailer New seminar
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Jan 90 15:18:00 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA04233; Tue, 16 Jan 90 14:30:44 PST
Date: Tue 16 Jan 90 14:30:40-PST
From: Greg O'Hair <OHAIR@CSLI.Stanford.EDU>
Subject: New seminar
To: phil-all@csli.Stanford.EDU, logic@csli.Stanford.EDU,
bboard@csli.Stanford.EDU
Message-Id: <632529040.0.OHAIR@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SEMINAR ON ISSUES IN LOGICAL THEORY, II
Greg O'Hair
Flinders University, visiting CSLI
Organizational meeting: Friday, January 19, 2:15pm
Cordura 104
This seminar will consist of an examination of the standard account of
logical consequence by way of a detailed reading of John Etchemendy's
forthcoming book, THE CONCEPT OF LOGICAL CONSEQUENCE. The first
meeting will be an organizational meeting to determine an acceptable
meeting time. If you are interested in attending, but cannot make the
first meeting, get in touch with me prior to the meeting.
Students will be able to take this seminar for credit.
-------
∂17-Jan-90 1533 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Categorical Combinators
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Jan 90 15:33:04 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA17793; Wed, 17 Jan 90 15:32:50 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04661; Wed, 17 Jan 90 15:32:07 -0800
Message-Id: <9001172332.AA04661@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5384; Wed, 17 Jan 90 17:30:22 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5365; Wed, 17 Jan 90 17:30:19 CST
Date: Wed, 17 Jan 90 17:28:05 CST
Reply-To: Dwight Spencer <dwights%csi.ogc.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Dwight Spencer <dwights%csi.ogc.edu@VM1.NoDak.EDU>
Subject: Categorical Combinators
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I have been working carefully through Curien's '86 book on categorical
combinators. This is supposedly a mild improvement of his '83 thesis, but
nevertheless the presentation remains dense and suffers from being a fairly
direct translation from the original French.
Thus I ask whether a tutorial paper or lecture notes on this subject
exist that would serve as a helpful supplement to this book.
Please reply be e-mail. Thanks for any assistance.
- Dwight
--
Dwight L. Spencer _________ Oregon Graduate Institute of Science and Technology
Dept. of Computer Science & Engineering ____ Beaverton, Oregon, USA, 97006-1999
E-mail: dwights@csi.ogc.edu / ...!ogicse!dwights __ Phone: (503) 690-1121 x7369
OGI => THIRD-most research-productive applied science university in the U.S.!!!
∂17-Jan-90 1536 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Horn clauses
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Jan 90 15:36:22 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA17999; Wed, 17 Jan 90 15:36:09 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04680; Wed, 17 Jan 90 15:34:06 -0800
Message-Id: <9001172334.AA04680@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5735; Wed, 17 Jan 90 17:31:51 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5716; Wed, 17 Jan 90 17:31:34 CST
Date: Wed, 17 Jan 90 17:28:25 CST
Reply-To: Kim Skak Larsen <mskak%daimi.dk@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Kim Skak Larsen <mskak%daimi.dk@VM1.NoDak.EDU>
Subject: Horn clauses
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
How difficult is resolution of propositional Horn clauses,
i.e. consider a prolog program without variables that looks
something like
a :- b,c.
b :- c.
c.
and not like
a(X,Y) :- b(X),c(X,Y).
etc...
What is the complexity of answering queries such as
a?
I heard a rumour about a result by Mike Paterson of O(n↑2).
Any references?
∂17-Jan-90 1607 ingrid@russell.Stanford.EDU CSLI Calendar, 18 January 1990, 5:13←∞
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Jan 90 16:07:01 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA07845; Wed, 17 Jan 90 15:36:43 PST
Date: Wed, 17 Jan 90 15:36:43 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001172336.AA07845@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 18 January 1990, 5:13←∞
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
18 January 1990 Stanford Vol. 5, No. 13
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 18 JANUARY 1990
12:00 noon TINLunch
Cordura 100 Twenty-five Basic Theorems in Situation Theory
Ed Zalta
(zalta@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 25 JANUARY 1990
12:00 noon TINLunch
Cordura 100 The Role of Central Conceptual Structures in the
Development of Scientific and Mathematical Thought
Robbie Case
School of Education, Stanford University
(ka.rob@forsythe.stanford.edu)
Abstract below
2:15 p.m.
Cordura 100 CSLI Seminar
HPSG from Afar
Paul John King
CSLI Postdoctoral Fellow
(pjking@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
The Role of Central Conceptual Structures
in the Development of Scientific and Mathematical Thought
Robbie Case
Piaget's structuralist view of human cognition is now considered
outmoded by most developmental theorists, both on rational and on
empirical grounds. One aspect of the position is still important,
however, and has not been adequately tested. This is the view that
human thought is both constrained and potentiated by cognitive
structures that do not have their origin either directly in our
empirical experience (as empiricist epistemology would hold), or
indirectly via the internalization of conceptual systems and skills
(as sociocultural epistemology would hold). According to Piaget,
these cognitive structures have their origin in the structure of
children's spontaneous mental operations, which is then abstracted and
subsequently serves to constrain what children acquire from their
physical or cultural experience. Some new data are presented that are
of relevance to this general claim, and it is shown that the data are
compatible with a slightly weaker version of the structuralist
hypothesis than Piaget originally formulated.
____________
NEXT WEEK'S CSLI SEMINAR
HPSG from Afar
Paul John King
In this informal seminar, I will outline SRL (Speciate Re-entrant
Logic), a "classical," semantically transparent, and (above all else!)
simple formalism that lets unification-based grammarians work safely
within the bounds of their intuitions. If time permits, I will
discuss HPSG's existing formalism and throw in a few observations I've
made of the unification-based enterprise. Please note: the maths
content will (I hope!) be simple, almost to the point of vacuity.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
Approaches to the Liar Paradox, Part I
John Etchemendy and Solomon Feferman
(etch@csli.stanford.edu and sf@csli.stanford.edu)
Thursday, 18 January, 3:45-5:30 p.m.
Cordura 100
(Please note new day, time, and room!)
We will explain parts of the work by Kripke, Martin and Woodruff, van
Fraassen, Gupta and Herzberger (a little), Aczel, Feferman, and
perhaps others. It will not be tied directly to chapter IV.10 of the
_Handbook of Philosophical Logic_.
Next week's topic is "Approaches to the Liar Paradox, Part II."
____________
SYMBOLIC SYSTEMS FORUM
Affordances for Reasoning
James Greeno
(greeno.pa@xerox.com)
Thursday, 18 January, 4:15 p.m.
Building 60, Room 62A
General concepts are often equated with their abstract
representations, but a representation doesn't provide generality
unless it is interpreted successfully. An example is the concept of
linear functions, studied in high-school algebra, which is often
taught in a real-life version of Searle's "Chinese Room." I'll report
progress on some research on situated reasoning about linear
functions, present a theory about how the situation supports the
reasoning, and describe a study about linear equations in this
setting.
IMPORTANT NOTE: The Symbolic Systems Forum will be meeting at a new
time and a new place this quarter. We hope that meeting on Thursdays
at 4:15 p.m. will allow more people to attend. If you have comments
about the time change, please address them to the forum chair,
Jennifer Cotteleer (jac@jessica). Room 62A is on the second floor of
building 60.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY, II
Organizational Meeting
Greg O'Hair
Flinders University, visiting CSLI
(ohair@csli.stanford.edu)
Friday, 19 January, 2:15 p.m.
Cordura 104
This seminar will consist of an examination of the standard account of
logical consequence by way of a detailed reading of John Etchemendy's
forthcoming book, _The Concept of Logical Consequence_. The first
meeting will be an organizational meeting to determine an acceptable
meeting time. If you are interested in attending, but cannot make the
first meeting, get in touch with Greg O'Hair prior to the meeting.
Students will be able to take this seminar for credit.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
Logic Programs with Classical Negation
Vladimir Lifschitz
Department of Computer Science
Stanford University
(val@sail.stanford.edu)
Monday, 22 January, 2:30 p.m.
Margaret Jacks Hall 252
(Please note new time!)
General logic programs are further generalized by including classical
negation, in addition to negation-as-failure. The semantics of such
"extended" programs is based on the method of stable models. We show
that some facts of commonsense knowledge can be represented by logic
programs more easily when classical negation is available.
Computationally, classical negation can be eliminated from extended
programs by a simple preprocessor. Extended programs are identical to
a special case of default theories in the sense of Reiter.
This is joint work with Michael Gelfond. If time permits, related
work of Robert Kowalski and Fariba Sadri on "logic programs with
exceptions" will be also reviewed.
____________
SYNTAX WORKSHOP
Lars Hellan
Monday, 22 January, 7:30 p.m.
Cordura 100
No abstract available.
____________
SITUATION SEMANTICS SEMINAR
Informativeness
Jonathan Ginzburg
(ginzburg@csli.stanford.edu)
Wednesday, 24 January, 3:30 p.m.
Cordura 100
By postulating his conversational maxims, Grice hoped to be able to
explain why at a given point in a discourse, a given conversational
contribution was made. In this talk, I will examine two of those
maxims, Quantity and Relevance, focusing on explicating the notion of
"informativeness," which underlies any formulation of the maxim of
Quantity. I will argue that understandings of the notion of
informativeness, or relevance, in various current pragmatic
frameworks, as entailment, the metric utilized by the "Neo Griceans"
(Horn 1972, Gazdar 1979, Atlas and Levinson 1981, Levinson 1987), or
"relevance," in the sense of Sperber and Wilson 1986 are inadequate
for the task of predicting utterance choice, with concomitant problems
when applied to explain other pragmatic phenomena, such as
implicature. I will advance an alternative explication of
informativeness, unifying concerns arising both from "relevance" and
"strength of information," and utilizing situation theory as the
underlying logic. I will argue for the need to recognize a
"two-dimensional" ordering on (information containment of) epistemic
states, that recognizes both "strength of information" and "degree of
anchoring of parameters." I will illustrate how a revised theory of
implicature can be constructed and show how this could be applied to
deal with cases of polysemy which the classical Gricean theory is ill
equipped to handle.
∂17-Jan-90 1658 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU REFERENCES on Reflection
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Jan 90 16:58:28 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23008; Wed, 17 Jan 90 16:57:38 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06093; Wed, 17 Jan 90 16:57:30 -0800
Message-Id: <9001180057.AA06093@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9057; Wed, 17 Jan 90 18:19:24 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9043; Wed, 17 Jan 90 18:19:21 CST
Date: Wed, 17 Jan 90 18:18:47 CST
Reply-To: Richard Hilliard <rh%mbunix.mitre.org@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Richard Hilliard <rh%mbunix.mitre.org@VM1.NoDak.EDU>
Subject: REFERENCES on Reflection
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I posted a query last month asking about work on attempts to formalize
the notion "reflection". Thanks to all who replied. Below is a list
references on its formalization, as well as other aspects of
reflection.
REFERENCES
Aiello, Luigia, Carlo Cecchi, and Dario Sartini, "Representation and
Use of Metaknowledge," Proceedings of the IEEE, 74 (10), October 1986.
Aiello, L., and R. W. Weyhrauch, "Using Meta-theoretic Reasoning to do
Algebra," Proc. 5th Conference on Automated Deduction, LNCS 87, New
York: Springer-Verlag, 1980.
Bawden, Alan, "Reification without Evaluation," Conference Record of
the 1988 ACM Symposium on Lisp and Functional Programming.
Caseau, Yves, "A model for a reflective object-oriented language," ACM
SIGPLAN Notices, Vol. 24, no. 4 (April 1989).
Danvy, Olivier and Karoline Malmkjaer, "Intensions and Extensions in a
Reflective Tower," Conference Record of the 1988 ACM Symposium on Lisp
and Functional Programming.
Danvy, O., "Across the Bridge between Reflection and Partial
Evaluation," Partial Evaluation and Mixed Computation, D. Bjorner,
A. P. Ershov and N. D. Jones (Editors), Elsevier Science Publishers B.
V. (North-Holland) IFIP, 1988.
des Rivieres, J. and B. C. Smith, "The implementation of procedurally
reflective languages," Conference Record of the 1984 ACM Symposium on
Lisp and Functional Programming, Austin, Texas (August 1984).
Feferman, S., "Transfinite recursive progressions of axiomatic
theories," J. Sym. Logic 27, 259-316 (1962).
Felleisen, M., The calculi of lambda-v-cs conversion: A syntactic
theory of control and state in imperative higher-order programming
languages. Ph.D. thesis, Indiana University, 1987.
Ferber, Jacques, "Computational Reflection in Class based Object
Oriented Languages," OOPSLA'89 Proceedings, SIGPLAN Notices, Vol. 24,
no. 10 (October 1989).
Friedman, D. P., and M. Wand, "Reification: Reflection without
Metaphysics," Conference Record of the 1984 ACM Symposium on LISP and
Functional Programming, Austin Texas (August 1984).
Foote, Brian and Ralph Johnson, "Reflective Facilities in Smalltalk-80,"
OOPSLA'89 Proceedings, SIGPLAN Notices, Vol. 24, no. 10 (October 1989).
H. Gazinger and N. D. Jones, Programs as Data Objects: proceedings of
a workshop. Springer-Verlag, 1986.
Graube, Nicolas, "Metaclass Compatibility," OOPSLA'89 Proceedings,
SIGPLAN Notices, Vol. 24, no. 10 (October 1989).
Maes, Pattie, "Concepts and experiments in computational reflection,"
OOPSLA '87 Proceedings, SIGPLAN Notices, Vol. 22, no. 12, (December
1987).
Maes, P. and D. Nardi (eds.), Meta-Level Architectures and Reflection.
North-Holland, Amsterdam, 1988.
Mason, I. A. and C. Talcott, "Programming, transforming and proving
with function abstractions and memories," submitted to Logic and
Computer Science, 1988.
Perlis, Donald, "Languages with self-reference I: Foundations (or: We
can have everything in first-order logic!)" Artificial Intelligence 25
(1985) 301-322.
Perlis, D., "Languages with self-reference II: Knowledge, Belief, and
Modality," Artificial Intelligence 34 (1988) 179-212.
Pfenning, Frank and Peter Lee, "Metacircularity in the Polymorphic
Lambda-Calculus," TAPSOFT '89 (revised version to appear in
Theoretical Computer Science).
Pierce, Benjamin, Scott Dietzen and Spiro Michaylov, Programming in
Higher-Order Typed Lambda-Calculi. Carnegie Mellon Computer Science
Department report CMU-CS-89-111, March 1989.
Smith, Brian C., "Varieties of Self-Reference," Theoretical Aspects of
Reasoning about Knowledge, Los Altos, California: Morgan Kaufman
(March 1986).
Smith, B. C., Reflection and Semantics in a Procedural Language. MIT
Laboratory for Computer Science, Technical Report 272, 1982.
Smith, B. C., "Reflection and Semantics in Lisp," Conference Record of
the 14th Annual ACM Symposium on Principles of Programming Languages,
Salt Lake City, Utah (January 1984).
Talcott, Carolyn, Rum: "An intensional theory of function and control
abstractions," Workshop on Functional and Logic Programming, Trento
Italy, December 1986, LNCS to appear, Springer-Verlag.
Talcott, C. and R. W. Weyhrauch, "Partial evaluation, higher-order
abstractions and reflection principles as system building tools,"
Partial Evaluation and Mixed Computation, D. Bj?rner, A. P. Ershov
and N. D. Jones (Editors), Elsevier Science Publishers B. V.
(North-Holland) IFIP, 1988.
Wand, M., and D. P. Friedman, "The mystery of the tower revealed: a
non-reflective description of the reflective tower," Conference Record
of the 1986 ACM Symposium on Lisp and Functional Programming,
Cambridge, Massachusetts (August 1986).
Watanabe, Takuo and Akinori Yonezawa, "Reflective Computation in
Object-Oriented Concurrent Systems and Its Applications," ACM SIGSOFT
Engineering Notes, Vol. 14, no. 3 (May 1989).
Watanabe, Takuo and Akinori Yonezawa, "Reflection in an
object-oriented concurrent language," ACM SIGPLAN Notices, Vol. 23,
No. 11, 306-315 (Nov. 1988).
Weyhrauch, Richard. W., "Prolegomena to a Theory of Mechanized Formal
Reasoning," Artificial Intelligence, vol. 13, no. 1,2. North-Holland,
Amsterdam.
Weyhrauch, R. W., "An Example of FOL Using Metatheory," 6th Conference
on Automated Deduction, New York, USA June 7-9, 1982, LNCS 138, New
York: Springer-Verlag, 1982.
Zalta, Intensional Logic, MIT Press, 1989.
--
Rich Hilliard
The MITRE Corporation (M/S A156)
Bedford, MA 01730
(617) 271-7760
Internet: rh@mbunix.mitre.org
UUCP: {decvax, philabs}!linus!rh
∂17-Jan-90 1757 grundy@csli.Stanford.EDU Symbolic Systems Forum schedule for winter quarter
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Jan 90 17:57:23 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA02311; Wed, 17 Jan 90 17:48:56 PST
Date: Wed 17 Jan 90 17:48:56-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum schedule for winter quarter
To: grundy@csli.Stanford.EDU
Message-Id: <632627336.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
THE SYMBOLIC SYSTEMS FORUM
Schedule for Winter Quarter, 1990
The Symbolic Systems Forum meets every Thursday
at 4:15 pm in building 60, room 62A.
*************************************************************
IMPORTANT NOTE: The Symbolic Systems Forum will be meeting
at a new time and a new place this quarter. We hope that
meeting on Thursdays at 4:15 pm will allow more people to
attend. If you have comments about the time change, please
address them to the forum chair, Jennifer Cotteleer
(jac@jessica). The new room, 60-62A, is on the second floor
of building 60.
*************************************************************
January 18
Jim Greeno, Education, SSP Director
"Affordances for Reasoning"
January 25
John Dupre, Philosophy
"Conversations with Apes: Reflections on the Scientific
Study of Language"
February 1
Annie Zaenen, Linguistics, Xerox PARC
"Verb Varieties: Syntax or Semantics?"
February 8
Herbert Lindenberger, Comparative Literature & English
"Literary Theory and Symbolic Systems"
February 15
John Lamping, Xerox PARC
"Why are Computer Programs so Complicated?"
February 22
Phil Cohen, Linguistics, SRI International
"Discourse Theory"
March 1
Pat Hayes, Computer Science, Xerox PARC
"Time Points or Time Intervals? Problems in
Axiomatising Common Sense"
March 8
Susan Stucky, Xerox PARC
"The Radically Efficient Agent in Context"
Suggestions for future speakers or inquiries about the Forum
mailing list may be sent to Bill Grundy (grundy@CSLI).
-------
∂18-Jan-90 0701 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Another Change in the Northeastern University Theory Day Program
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 07:01:09 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25016; Thu, 18 Jan 90 06:53:57 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14710; Thu, 18 Jan 90 06:46:55 -0800
Message-Id: <9001181446.AA14710@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2112; Thu, 18 Jan 90 08:39:24 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2089; Thu, 18 Jan 90 08:39:12 CST
Date: Thu, 18 Jan 90 08:37:42 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
alan selman <selman@corwin.ccs.northeastern.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: alan selman <selman%corwin.ccs.northeastern.edu@VM1.NoDak.EDU>
Subject: Another Change in the Northeastern University Theory Day Program
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Josep Diaz is ill with the flu. The 11 a.m. talk will be given by Stuart
Kurtz on the Isomorphism Conjecture.
∂18-Jan-90 0709 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Seminar, Tel Aviv University, Israel, Friday, Jan 19
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 07:08:53 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25119; Thu, 18 Jan 90 07:02:33 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14700; Thu, 18 Jan 90 06:42:37 -0800
Message-Id: <9001181442.AA14700@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2155; Thu, 18 Jan 90 08:39:47 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2139; Thu, 18 Jan 90 08:39:41 CST
Date: Thu, 18 Jan 90 08:38:14 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Bluma Roth <bluma@TECHSEL.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Bluma Roth <bluma%TECHSEL.BITNET@VM1.NoDak.EDU>
Subject: Seminar, Tel Aviv University, Israel, Friday, Jan 19
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Here is the final program, including revised titles and abstracts
for the SEMINAR ARTZI. It will take place, as usual, in the Schriver
Building (Math Dept), Tel Aviv University on Friday, Jan 19.
9:30 Uri feige, Weizmann
10:15 Amos Israeli, Technion
11:00 Break
11:30 Mario Szegedy, Hebrew U.
12:15 Adi Shamir, Weizmann
Here are the details:
Speaker: Uri Feige, Weizmann Institute
Title: Sorting With Noisy Comparisons
Consider comparison based algorithms for sorting, where each
comparison independently has probability 1/3 of giving the wrong
answer. Sorting with confidence 1 - 1/poly(n) can be achieved in
O(n log↑2(n)) noisy comparisons, simply by repeating each comparison
O(log n) times and taking a majority vote. But can one do better?
In this talk, we fully characterize the "Noisy Comparison Complexity"
of sorting, merging, element distinctness, finding the maximum and
finding the median.
Joint work with David Peleg, Prabhakar Raghavan and Eli Upfal.
Speaker: Amos Israeli, Dept. of Electrical Engineering, Technion
Title: Token Management Schemes and Random Walks Yield
Self Stabilizing Mutual Exclusion
Abstract:
A self-stabilizing system is a system which starting from
any ARBITRARY configuration reaches a LEGAL
configuration by itself, without any kind of an outside
intervention. Hence a self-stabilizing system
accommodates any possible initial configuration.
This fact contributes most of the extra difficulty
of devising self-stabilizing systems. On the other hand, the same
fact makes self-stabilizing systems so appealing as no initialization
of the system is required.
In this work we present a novel modular method for constructing
uniform self stabilizing mutual exclusion (or in short UMESS)
protocols is presented. The viability of the method is
demonstrated by constructing for the first time a randomized UMESS
protocol for any arbitrary graph and another one for dynamic rings.
The correctness and complexity of both protocols
will be discussed. The analysis of the new protocols involves
the introduction of a new kind of single player token games
which are of an independent interest.
(Joint work with Marc Jalfon, Dept. of Computer Science Technion)
Speaker: Mario Szegedy, Hebrew University
Title: Functions with bounded symmetric communication complexity
The branch of circuit complexity theory most studied in the recent past is
the theory of circuits with bounded depth. Ajtai and independently
Furst, Saxe and Sipser were the first ones who
gave a superpolynomial lower bound on the size of bounded depth
circuits that compute the parity function (or the majority function).
Later by improving the method of Razborov, Smolensky
proved that bounded depth circuits with AND, OR and MODm gates must
have exponential size if they compute the majority function assuming
m is a prime power.
The difference between m being a prime power or an arbitrary
natural number may seem insignificant, but as a number of
attempts show the behavior of circuits with
MODm gates for a composite number m is much less understood.
We speculate that the reason why circuits with such gates may be
unable to compute the majority function is the poor
ability of the gates to collect the data necessary
for the computation.
We consider Boolean functions which have bounded symmetric
communication complexity, i.e. bounded communication complexity
under all partitions of the input. We give an explicit characterization
of these classes of functions by showing that they can be represented in a
natural way by commutative semigroups of bounded size.
As a consequence we deduce that unbounded fanin circuits
with gates with bounded symmetric communication complexity
can be simulated by circuits with AND, OR and MODm gates
for bounded m, with only linear increase in size and depth.
This shows the robustness of the concept of bouned depth, poly
size circuits with such gates suggesting a possible new
approach to lower bounds for such circuits.
Speaker: Adi Shamir, Weizmann Institute
Title: IP = PSPACE
Abstract: The class IP of languages which have efficient interactive
proofs of membership was introduced by Goldwasser, Micali and Rackoff
and independently by Babai. Goldreich, Micali and Wigderson showed
that IP contains some languages beleived not to be in NP.
Very recently, Fortnow, Karloff, Lund and Nisan showed that IP
contained the polynomial hierarchy, but its
exact characterization remained open.
In this talk we settle this question by showing that the proofs which
can be interactively verified in polynomial time are exactly those
proofs which can be generated in polynomial space.
∂18-Jan-90 0713 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Bipartite Subgraphs...
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 07:13:17 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25124; Thu, 18 Jan 90 07:07:01 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14716; Thu, 18 Jan 90 06:49:20 -0800
Message-Id: <9001181449.AA14716@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2203; Thu, 18 Jan 90 08:42:37 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2172; Thu, 18 Jan 90 08:40:05 CST
Date: Thu, 18 Jan 90 08:38:27 CST
Reply-To: Der-Tsai Lee <dlee%note.nsf.gov@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Der-Tsai Lee <dlee%note.nsf.gov@VM1.NoDak.EDU>
Subject: Bipartite Subgraphs...
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Dear Colleagues:
I have the following problem and I don't know of any solution.
I thought you may be able to help.
Consider a bipartite graph G=(V,E), where V is partitioned into
two subsets Y and Z and E is a subset of Y x Z. I would like to
find out if there exists any "efficient" algorithm that solves
the following problem: Given the bipartite graph G as defined
above, determine if there exists a subgraph G' of G such that
G'=(V',E') where V' is partitioned into Y' and Z', Y' is
a subset of Y, Z' a subset of Z, E' contains all the edges in
E of the form (y,z), y in Y', z in Z', and the cardinality of Y'
is NO LESS THAN that of Z'.
If so, find it; otherwise, report none.
In other words, one may look at a bipartite graph as a
binary relation, represented as an adjacency matrix Y by Z.
Entry (y,z) is 1 if (y,z) is in E; otherwise it is 0.
The problem is to see if the rows and columns of the matrix
can be permuted so that we have a "rectangular block" of
dimension |Y'| by |Z'| such that |Y'| >= |Z'|, and the entries
in these |Y'| rows that are outside the |Z'| columns are all
zero's.
I suppose there must be results known about the problem. If any
of you can provide pointers to the solution, I'd appreciate very
much. My mailing address:
D.T.Lee
Division of Computer & Computation Research
National Science Foundation
1800 G. Street, N.W.
Washington, D.C. 20550
Tel:(202)-357-7375
Fax:(202)-357-0320
e-mail:dlee@note.nsf.gov
∂18-Jan-90 0756 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU Reminder: AFLB at 12:00 (note new time)
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 07:56:22 PST
Received: from wolvesden.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25743; Thu, 18 Jan 90 07:54:05 -0800
Received: by wolvesden.Stanford.EDU (5.61 (wolvesden 9/7/89)/inc-1.01)
id AA13971; Thu, 18 Jan 90 07:53:33 -0800
Message-Id: <9001181553.AA13971@wolvesden.Stanford.EDU>
To: aflb-all@neon.stanford.edu
Subject: Reminder: AFLB at 12:00 (note new time)
Date: Thu, 18 Jan 90 07:53:31 PST
From: Alexander Wang <axwang@wolvesden.Stanford.EDU>
AFLB will be meeting today at 12:00 in MJH 252.
Small-bias probability spaces: efficient constructions and appli-
cations.
Seffi Naor
We show how to efficiently construct a small probability space on
$n$ binary random variables such that for every subset, its pari-
ty is either zero or one with ``almost" equal probability. They
are called $epsilon$-biased random variables. The number of ran-
dom bits needed to generate the random variables is $O(log n +
log {1/epsilon})$. Thus, if $epsilon$ is polynomially small,
then the size of the sample space is also polynomial.
$epsilon$-biased random variables can be used to construct "al-
most" $k$-wise independent random variables where $epsilon$ is a
function of $k$.
These probability spaces have various applications:
(1) Derandomization of algorithms: many randomized algorithms
that require only $k$-wise independence of their random bits
(where k is O(log n)$), can be derandomized by using $epsilon$-
biased random variables.
(2) Reducing the number of random bits required by certain ran-
domized algorithms, e.g., verification of matrix multiplication.
(3) Exhaustive testing of combinatorial circuits. We provide the
smallest known family for such testing.
(4) Communication complexity: two parties can verify equality of
strings with high probability exchanging only a logarithmic
number of bits.
(5) Hash functions: we can construct a polynomial sized family of
hash functions such that with high probability, the sum of a ran-
dom function over two different sets is not equal.
This is joint work with Moni Naor.
∂18-Jan-90 1207 tobagi@bodega.Stanford.EDU Dr. S. Bedrosian, U of Penn
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 12:06:56 PST
Received: from bodega.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Thu, 18 Jan 90 12:04:15 PST
Received: by bodega.Stanford.EDU (5.57/Ultrix3.0-C)
id AA03825; Thu, 18 Jan 90 11:56:01 PST
Date: Thu, 18 Jan 1990 11:56:00 PST
From: Fouad Tobagi <tobagi@bodega.stanford.edu>
To: ee-faculty@sierra.stanford.edu
Cc: tobagi@bodega.Stanford.EDU
Subject: Dr. S. Bedrosian, U of Penn
Message-Id: <CMM.0.88.632692560.tobagi@bodega.stanford.edu>
To whom it may concern,
I received a message a day ago informing me of the sad news regarding Dr.
Samuel Bedrossian, Professor of Electrical Engineering, University of
Pennsylvania. He passed away as a result of a heart attack at school on
Friday the 12th. He was only 68 years of age.
I have recently given a colloquium at the University of Pennsylvania
(November 30th) and he was my host. The colloquium assistant there (Ms.
Deborah Coy) asked me if I could help in informing his colleagues here at
Stanford, hence this message. She can be reached at Coy@pender.ee.upenn.edu.
Sincerely,
Fouad Tobagi
∂18-Jan-90 1222 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU DIMACS
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 12:22:14 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA09278; Thu, 18 Jan 90 12:21:58 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18752; Thu, 18 Jan 90 12:21:54 -0800
Message-Id: <9001182021.AA18752@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9097; Thu, 18 Jan 90 14:21:07 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9082; Thu, 18 Jan 90 14:21:04 CST
Date: Thu, 18 Jan 90 14:20:28 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
jf@research.att.com
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: jf%research.att.com@VM1.NoDak.EDU
Subject: DIMACS
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The next DIMACS seminar will take place at AT&T Bell Labs
on Friday, February 16, 1990.
The speakers will be A. C. Yao (Princeton), R. Rivest (MIT),
and G. Simmons (Sandia).
Titles, abstracts, schedule, and directions will be sent to the
DIMACS-members and DIMACS-outside mailing lists. If you are
not on the appropriate one of those lists and would like to
be, send email to ida@dimacs.rutgers.edu (NOT TO ME!).
If you would like to attend the seminar, please send email to
jf@research.att.com as soon as possible. Advance warning of
who will be here will speed up the signing-in process.
∂18-Jan-90 1422 ingrid@russell.Stanford.EDU Talk Announcement for Friday, 19 January, 1:30 p.m.
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Jan 90 14:22:25 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA13811; Thu, 18 Jan 90 14:02:51 PST
Date: Thu, 18 Jan 90 14:02:51 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001182202.AA13811@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Talk Announcement for Friday, 19 January, 1:30 p.m.
A New Japanese National Project:
Software Architecture for Cooperative Agents
Hideyuki Nakashima
Electrotechnical Laboratory, Tsukuba, Japan
Friday, 19 January, 1:30 p.m.
Cordura 100
MITI has just launched an eight-year software project. The main goal
is to develop an innovative paradigm for developing flexible software.
By "flexible" we mean software that can adjust its own behavior
according to the surrounding situation. Dr. Nakashima will talk about
why the idea of situation theory is important to the project.
∂18-Jan-90 1429 LOGMTC-mailer seminar
To: logmtc@SAIL.Stanford.EDU
From: Ian Mason <IAM@SAIL.Stanford.EDU>
Speaker: Matthias Felleisen, Rice University
Title: On the Expressive Power of Programming Languages
Time: Monday, January 22, noon
Place: 252 MJH (Stanford CSD)
Abstract:
Are all (sequential) programming languages equal? No, of course not:
some are more equal, some less. We all know that some languages are more
expressive than others; otherwise we would all be programming with
Turing Machines.
Unfortunately, there is no formal framework for formalizing statements
about the *expressiveness* of programming languages and for deriving
interesting consequences. As a first step in this direction, I propose a
notion of *expressibility*, i.e., a relation that determines whether or
not a programming language can express some programming construct. This
notion seems to capture the intuitive and publicized understanding of the
programming language landscape. Moreover, the induced expressiveness
relation for languages seems to imply that programs in a more expressive
language tend to be shorter than equivalent programs in less expressive
languages.
Based on this promising first step, I suggest a series of more interesting
questions in the same direction and outline a research program.
∂19-Jan-90 1216 ingrid@russell.Stanford.EDU Language Acquisition Interest Group Meetings
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Jan 90 12:16:04 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA19170; Fri, 19 Jan 90 11:35:48 PST
Date: Fri, 19 Jan 90 11:35:48 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001191935.AA19170@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Language Acquisition Interest Group Meetings
LANGUAGE ACQUISITION INTEREST GROUP
At noon on the dates below
Building 100, Greenberg Room
Tue, 23 Jan Acquisitional Principles in Lexical Development
Eve Clark
Tue, 6 Feb Workshop on Steve Pinker's Theory of the Acquisition
of Argument Structures
Jess Gropen
Readings:
(1) Pinker, S. 1987. Resolving a Learnability
Paradox in the Acquisition of the Verb Lexicon.
Lexicon Project Working Paper, 17. (Cambridge,
Mass.: MIT Center for Cognitive Science.)
(2) Pinker, S. 1989. Learnability and Cognition.
Tue, 20 Feb Temporality in Untutored Adult Second Language
Acquisition: Functional Approach to Data Analysis
Marya Teutsch-Dwyer
Tue, 6 Mar To be announced
EVERYONE IS WELCOME!
If you have any questions or have a paper you'd like to present,
please send email to m.mahout@macbeth.
∂19-Jan-90 2253 grundy@csli.Stanford.EDU Symbolic Systems Forum January 25
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Jan 90 22:53:21 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA21153; Fri, 19 Jan 90 22:48:07 PST
Date: Fri 19 Jan 90 22:48:06-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum January 25
To: grundy@csli.Stanford.EDU
Message-Id: <632818086.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, January 25, 1990
Building 60, Room 62-A, 4:15 pm
Speaker: John Dupre
Topic: "Conversations with Apes: Reflections on the
Scientific Study of Language"
ABSTRACT
--------
In this talk I will look at some of the different
attempts that have been made to teach symbolic systems,
including American sign language, to various apes. I'll
also discuss the main criticisms that have been directed
against these attempts. I shall argue that these criticisms
reveal serious conflicts between assumptions about correct
scientific methodology and the very possibility of the kind
of research project envisaged by the ape language
researchers. Finally I shall offer a few suggestions about
why this research and its evaluation has seemed so important
to some people.
-------
∂21-Jan-90 2138 LOGMTC-mailer Seminar reminders
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Jan 90 21:38:17 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20521; Sun, 21 Jan 90 21:37:53 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA02196; Sun, 21 Jan 90 21:16:03 PST
Message-Id: <9001220516.AA02196@iswim.stanford.EDU>
To: logmtc@sail.Stanford.EDU, daniel@mojave.Stanford.EDU, lam@cs.Stanford.EDU
Subject: Seminar reminders
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Sun, 21 Jan 90 21:16:02 PST
Sender: jcm@iswim.Stanford.EDU
In addition to Felleisen's talk Monday at noon, there will be
POPL-related talks Monday and Tuesday at 4 PM. The talks are:
Monday, 4 PM, Room TBA
John Hughes, Glasgow, on analysis of higher-order polymorphic
functions. (I expect to post abstract Monday morning when he
arrives.)
Tuesday, 4 PM, Room 301 Margaret Jacks Hall
TITLE: Reduction for the Computational Lambda-Calculus
SPEAKER: Eugenio Moggi
AFFILIATION: University of Cambridge (on leave from Univ. of Edinburgh)
ABSTRACT
Reduction for the computational lambda-calculus [Moggi89]
is studied in the framework of many sorted Combinatory Reduction
Systems (CRS), a generalisation of CRS (proposed in [Aczel78,Klop]),
which is more suitable to model the distinction between "values" and
"computations".
First, we investigate how a CRS can be related to a categorical model
of the computational lambda-calculus, i.e. a cartesian closed category
with a "strong monad".
Second, we discuss uses and limitations of the sufficient conditions
on CRS ensuring Church-Rosser in relation to the computational
lambda-calculus.
Finally, we consider an application of reduction: conservativity of
computational lambda-calculus over call-by-name lambda-calculus.
∂22-Jan-90 0812 LOGMTC-mailer seminar reminder
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker: Matthias Felleisen, Rice University
Title: On the Expressive Power of Programming Languages
Time: Monday, January 22, noon
Place: 252 MJH (Stanford CSD)
∂22-Jan-90 0833 eisensee@sierra.STANFORD.EDU Solid State Seminar
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 90 08:33:01 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Mon, 22 Jan 90 08:29:27 PST
Date: Mon, 22 Jan 90 08:29:27 PST
From: eisensee@sierra.STANFORD.EDU (Sandra K. Eisensee)
To: ee-adminlist@sierra, ee-faculty@sierra, Iclabusers@glacier
Cc: cis-people@glacier
Subject: Solid State Seminar
Message-Id: <CMM.0.88.633025765.eisensee@>
SOLID STATE LAB SEMINAR
AKA EE 430
TIME: 4:00pm REFRESHMENTS
4:15pm TALK STARTS
PLACE: AEL 109
DATE: JANUARY 24, 1990
DR. MASAO YAMADA
ADVANCED TECHNOLOGY DIVISION
FUJITSU LTD.
KAWASAKI, JAPAN
"Ta/SiC Masks for X-Ray Lithography"
Engineering accurate and defect-free masks is the major technical
obstacle to the successful application of X-ray lithography to the manufacture
of deep submicron ULSI circuits. Dr. Yamada, group leader of X-ray mask
technology, will present a comprehensive up to date technologies of Ta/SiC
X-ray masks which were developed at Fujitsu Limited.
∂22-Jan-90 0923 LOGMTC-mailer MSRI seminars for 1/22 - 1/26/90
Received: from msri.org (gauss.msri.org) by SAIL.Stanford.EDU with TCP; 22 Jan 90 09:23:36 PST
Received: by msri.org (AIX 2.1.2/s2.2)
id AA27917; Mon, 22 Jan 90 09:16:41 PST
Date: Mon, 22 Jan 90 09:16:41 PST
From: abaxter@msri.org (Arlene Baxter)
Message-Id: <9001221716.AA27917@msri.org>
To: weekly@msri.org
Subject: MSRI seminars for 1/22 - 1/26/90
Cc: abaxter@msri.org
Mathematical Sciences Research Institute
1000 Centennial Drive * Berkeley, CA 94720 * (415) 642-0143
Seminar Announcements for the week of
January 22 - 26, 1990
Workshop on Applications of Algebraic Topology
to Geometry and Analysis
Tentative schedule of talks
MONDAY
9:30 - 10:30 D. Freed
"Elementary examples of topological quantum field theories"
11:00 - 12:00 D. McDuff
"Rational and ruled symplectic 4-manifolds"
2:15 - 3:15 R. Melrose
"Singular limits, pseudodifferential operators, and Hodge theory"
4:00 - 5:00 J.L. Brylinski
"The geometry of the space of knots"
TUESDAY
9:30 - 10:30 M. Freedman
"An application of norms on homology to geometry and physics"
11:00 - 12:00 J. Rosenberg
"Manifolds of positive scalar curvature"
2:15 - 3:15 T. Farrell
"Topological versus smooth rigidity"
4:00 - 5:00 E. Friedlander
"A topological filtration on the homology of algebraic varieties"
WEDNESDAY
9:30 - 10:30 B. Lawson
"A theory of algebraic cocycles"
11:00 - 12:00 R. Bott
"Stable bundles revisited"
2:15 - 3:15 C. Boyer
"The topology and geometry of instanton moduli spaces"
4:00 - 5:00 R. Fintushel
"Homology 3-spheres in 4-manifolds"
6:30 - Wine and Cheese - Heyns Rm, Fac. Club
THURSDAY
9:30 - 10:30 R. Cohen
"Monopoles, instantons, and configuration spaces"
11:00 - 12:00 M. Karoubi
"Some applications of K-theory"
2:15 - 3:15 S. Cappell
"Singular varieties and intersection homology"
4:00 - 5:00 S. Stolz
"Simply-connected manifolds of positive scalar curvature"
FRIDAY
9:30 - 10:30 J. Jones
"Braids, monopoles, and the Dirac operator"
11:00 - 12:00 S. Hurder
"Secondary invariants and spectral theory of operators"
2:15 - 3:15 J. Cheeger
"Eta invariants, families index, and secondary Euler classes for SL(2n,Z)-bundles"
4:00 - 5:00 E. Getzler
"Equivariant cyclic homology and equivariant differential forms"
ADDITIONAL SEMINARS
TUESDAY
MODEL THEORY 5:30 MSRI Lecture Hall
B. Zilber "Model Theory of Algebraically Closed Fields" (II)
WEDNESDAY
RECURSION THEOR 1:00 MSRI Lecture Hall
Y. Moschovakis "The Modeling of Concurrency and Non-Deterministic Recursion"
THURSDAY
MODEL THEORY 5:30 MSRI Lecture Hall
B. Zilber "Model Theory fo Algebraically Closed Fields" (III)
∂22-Jan-90 1123 @RELAY.CS.NET:mazzetti@ed.aaai.org prize paper award - part 1 of 2
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 22 Jan 90 11:22:22 PST
Received: from relay2.cs.net by RELAY.CS.NET id ab25312; 22 Jan 90 13:22 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa17296; 22 Jan 90 14:16 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA07264; Mon, 22 Jan 90 10:04:12 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA12766; Mon, 22 Jan 90 10:10:14 PST
Date: Mon, 22 Jan 90 10:10:14 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9001221810.AA12766@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Subject: prize paper award - part 1 of 2
Cc: mazzetti@nilsson
Enclosed is a message from Bill Swartout who argues for the elimination
of the prize paper awards presented at the national conference. His
original message was sent to myself, Howie, Tom Dietterich and Danny
requesting their views on this matter. The next message will be
the respondents' comments on Bill's msg.
The conference committee and program chairs would like to come to
some consensus about this issue before the program committee
meeting at the end of March. I look forward to your comments on this matter.
Claudia
*********************************************
Danny, Tom, Howie and Claudia,
Here is a draft note to get discussion started about the issue of
prizes at AAAI. Any comments before it gets sent out to the
conference committee as a whole?
-Bill
Prizes at AAAI
One issue that has come up at almost every program committee meeting is the
issue of prizes at AAAI. We have tried a number of different approaches to
giving a prize, such as giving just one prize for the whole conference, giving
one prize per program topic area, mentioning the papers that were nominated
for a prize, or only mentioning those that won. At the AAAI conference
committee meeting at IJCAI there was a lot of dissatisfaction expressed about
prizes, and a number of questions were raised about what we were really trying
to accomplish by giving out prizes and whether we were really achieving those
goals.
I think we need to seriously reconsider prizes at AAAI, and whether or not we
should be giving them. In this note I've tried to summarize some of the major
issues. I have not tried to be completely neutral in writing this note.
Personally, I think we should drop prizes. This note is intended to be a
springboard for further discussion, which I hope will lead to a resolution of
the issue.
Issues:
Unclear Motivation
What is the Publisher's Prize awarded for? The official
answer, as I recall, is that the prize is given to that paper that best
exemplifies good expository writing. Technical content is important,
but not the only concern and perhaps not even primary. Unfortunately,
many people (including, perhaps, the reviewers) don't understand this
point, and think that technical content is the primary criteria in the
award. Our phone conversation on Wednesday revealed that even in AAAI
officialdom there are conflicting interpretations about what the prize
is all about.
Selection Process
Because the selection criteria are unclear, the selection process is
inherently problematic. However, even if the selection criteria were
unambiguous, there would still be problems. Suppose that it was
generally agreed that the main criteria for evaluation was technical
content. As was pointed out during our phone conversation, there may be
several papers within a subarea that are all of very high technical
quality, and trying to choose among them is like trying to optimize on a
flat plane. Currently, we don't have any way of reflecting the
closeness of the contenders in the outcome of the decision process. In
the interest of fairness, it would seem that we would want something
like that.
There also seems to be an unacceptably high level of randomness in the
process of nominating papers to be considered for the prize. As an egregious
example, I recall that a few years ago one paper was nominated for a prize and
forwarded to the prize committee for evaluation. The prize committee, after
evaluating the paper closely, decided that it should have been rejected from
the conference! There seems to be an awful lot of noise in the system.
Unevaluated Presentation
Currently, the winners of the prize are invited to present their paper
before a plenary session of the conference. The problem that this
raises is that there is no opportunity to review the presentation before
it is made. Some of the presentations have been excellent, but others
have been quite poor. (A memorable example of the latter was a
presentation where the slides consisted of paragraphs of text lifted
from the paper verbatim.) In our phone conversation, it was argued that
we are also sometimes disappointed by the presentations given by invited
speakers. That is certainly true, however, the speaking skills of
invited speakers are known before they are invited, while those of prize
winners are often unknown (at least to most of the committee).
Furthermore, speaking skills are not one of the criteria used in
deciding who should receive the prize. It seems odd to hold up the
winner's talk as a model presentation, when in fact no one on the
committee has evaluated it.
Philosophical
For me, perhaps the strongest argument against prizes is philosophical. I
would like to think that AI researchers don't need prizes to be motivated to
do good work or to write good papers. There are many better motives for doing
research than the hope of winning a prize. For me, a strong motive for
research is quite simply that it's a fun and exciting thing to do. I try to
write clear papers because I want to communicate what I've done. Prizes
substitute an external reward in place of internal motivation. Although I
don't think it's happened in AI yet, it is easy to point to other fields where
real problems have occurred because winning a prize became the focus rather
than the process of doing science.
Some possible solutions:
1. Do away with prizes
-assume that people will find out about good writing in the
proceedings in the same way that they find out about good
writing in journals: by reading it themselves or having it
recommended by colleagues.
2. Highlight excellent papers during the summary session
If we have summary sessions at AAAI (as at IJCAI-89) the summarizers could
highlight papers that were particularly good, and what was interesting about
them. The papers could be selected by the area subcommittee. The advantages
of this approach are: 1) it is a lower key way of pointing out good work, 2)
if several papers are of high quality they all can be mentioned, and 3) by
stating the reasons for selecting the paper it can be cast in the context of
other work going on in the area.
3. A variant on 2 would be to do everything in 2 and in addition, for each
area, select one particularly accessible paper for presentation at a plenary
session of the conference.
-Bill
-------
-------
-------
----- End Forwarded Message -----
----- End Forwarded Message -----
∂22-Jan-90 1126 @RELAY.CS.NET:mazzetti@ed.aaai.org prize paper award - part 2 of 2
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 22 Jan 90 11:25:43 PST
Received: from relay2.cs.net by RELAY.CS.NET id ag25375; 22 Jan 90 13:25 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa17363; 22 Jan 90 14:22 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA07273; Mon, 22 Jan 90 10:06:07 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA12776; Mon, 22 Jan 90 10:12:01 PST
Date: Mon, 22 Jan 90 10:12:01 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9001221812.AA12776@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Subject: prize paper award - part 2 of 2
Cc: mazzetti@nilsson
Here are the respondents' comments.
Claudia
---------------
1) 22-Dec bobrow.pa@Xerox Re: Prizes at AAAI
2) 22-Dec Claudia Mazzett Re: Prizes at AAAI
3) 22-Dec bobrow.pa@Xerox Re: Prizes at AAAI
4) 27-Dec Pat Hayes Prizes at AAAI
5) 27-Dec Peter Friedland AAAI goings on
6) 29-Dec Howard Shrobe Prizes at AAAI
Message 1 -- ************************
Posted-Date: Fri, 22 Dec 89 11:05 PST
Received-Date: Fri, 22 Dec 89 11:21:34 -0800
Received: from Xerox.COM by vaxa.isi.edu (5.61/5.61)
id AA22907; Fri, 22 Dec 89 11:21:34 -0800
Received: from Semillon.ms by ArpaGateway.ms ; 22 DEC 89 11:13:20 PST
Date: Fri, 22 Dec 89 11:05 PST
From: bobrow.pa@Xerox.COM
Subject: Re: Prizes at AAAI
To: SWARTOUT@VAXA.ISI.EDU
Cc: hes@VALLECITO.SCRC.SYMBOLICS.COM, tgd@CS.ORST.EDU, bobrow.pa@Xerox.COM,
mazzetti@ed.aaai.org, hayes.pa@Xerox.COM
In-Reply-To: <630348913.0.SWARTOUT@VAXA.ISI.EDU>
Message-Id: <19891222190552.3.BOBROW@BULLWINKLE.parc.xerox.com>
Line-Fold: no
Date: Fri, 22 Dec 89 08:55:13 PST
From: Bill Swartout <SWARTOUT@VAXA.ISI.EDU>
Danny, Tom, Howie and Claudia,
Here is a draft note to get discussion started about the issue of
prizes at AAAI. Any comments before it gets sent out to the
conference committee as a whole?
-Bill
Prizes at AAAI
One issue that has come up at almost every program committee meeting is the
issue of prizes at AAAI. We have tried a number of different approaches to
giving a prize, such as giving just one prize for the whole conference, giving
one prize per program topic area, mentioning the papers that were nominated
for a prize, or only mentioning those that won. At the AAAI conference
committee meeting at IJCAI there was a lot of dissatisfaction expressed about
prizes, and a number of questions were raised about what we were really trying
to accomplish by giving out prizes and whether we were really achieving those
goals.
I think we need to seriously reconsider prizes at AAAI, and whether or not we
should be giving them. In this note I've tried to summarize some of the major
issues. I have not tried to be completely neutral in writing this note.
Personally, I think we should drop prizes. This note is intended to be a
springboard for further discussion, which I hope will lead to a resolution of
the issue.
In the spirit in which Bill composed his note, I will argue for
retention of prizes for papers at the AAAI conference. Such awards
should be for papers that show both excellence in technical ideas
combined with good expository writing that makes the ideas accessible.
I believe prize papers serve several valuable purposes:
1) Provide models for younger researchers to emulate
2) Provide recognition for outstanding work; this is useful for the individuals
recognized.
3) Provide examples of leading edge research in subfields;
this is useful in trying to keep AI from splintering into subfields.
4) Provide an opportunity for program committee members to look at
differing styles of research and writing across subfields
Issues:
Unclear Motivation
What is the Publisher's Prize awarded for? The official
answer, as I recall, is that the prize is given to that paper that best
exemplifies good expository writing. Technical content is important,
but not the only concern and perhaps not even primary. Unfortunately,
many people (including, perhaps, the reviewers) don't understand this
point, and think that technical content is the primary criteria in the
award. Our phone conversation on Wednesday revealed that even in AAAI
officialdom there are conflicting interpretations about what the prize
is all about.
The award has always specified that excellent technical content and good
expository writing must both be present in a prize paper. Even if
reviewers misunderstand these instructions, when the prize subcommittee
meets, it certainly will understand and provide a second level of
filtering.
Selection Process
Because the selection criteria are unclear, the selection process is
inherently problematic. However, even if the selection criteria were
unambiguous, there would still be problems. Suppose that it was
generally agreed that the main criteria for evaluation was technical
content. As was pointed out during our phone conversation, there may be
several papers within a subarea that are all of very high technical
quality, and trying to choose among them is like trying to optimize on a
flat plane. Currently, we don't have any way of reflecting the
closeness of the contenders in the outcome of the decision process. In
the interest of fairness, it would seem that we would want something
like that.
In any giving of prizes, one hopes for lots of good choices. This makes
the selection harder, but means that in terms of satisfying the goals
above, it is hard to make a mistake. Not everyone can win first place
(though even there is a real tie, there is no reason not to give two
awards), but the losers haven't lost anything that not giving prizes
would give them back.
I don't think it is necessary to give prizes in all areas of the
conference if the quality of papers in any area is not deemed
appropriate. The idea is to recognize excellence, and to encourage
breadth of interest by recognizing a range of areas.
There also seems to be an unacceptably high level of randomness in the
process of nominating papers to be considered for the prize. As an egregious
example, I recall that a few years ago one paper was nominated for a prize a nd
forwarded to the prize committee for evaluation. The prize committee, after
evaluating the paper closely, decided that it should have been rejected from
the conference! There seems to be an awful lot of noise in the system.
The system should be biased towards errors in which false positives are
suggested, rather than missing potential real winners. This is why the
two level filtering system is useful. You start with a wide bandwidth
signal, and filter.
Unevaluated Presentation
Currently, the winners of the prize are invited to present their paper
before a plenary session of the conference. The problem that this
raises is that there is no opportunity to review the presentation before
it is made. Some of the presentations have been excellent, but others
have been quite poor. (A memorable example of the latter was a
presentation where the slides consisted of paragraphs of text lifted
from the paper verbatim.) In our phone conversation, it was argued that
we are also sometimes disappointed by the presentations given by invited
speakers. That is certainly true, however, the speaking skills of
invited speakers are known before they are invited, while those of prize
winners are often unknown (at least to most of the committee).
Furthermore, speaking skills are not one of the criteria used in
deciding who should receive the prize. It seems odd to hold up the
winner's talk as a model presentation, when in fact no one on the
committee has evaluated it.
The opportunity to present one's work before the full conference is part
of the prize. The talks are not necessarily a model, though in my
experience, these talks on the average are significantly above the
conference average (I agree there have been bad counter examples). The
prize is not for presentation, but perhaps we can do something about
improving the level of presentations. For example, prize winners can be
invited to come early, have one extra day's expenses paid by the people
who offer prizes, and have a presentation review. Perhaps there are
other ideas.
Philosophical
For me, perhaps the strongest argument against prizes is philosophical. I
would like to think that AI researchers don't need prizes to be motivated to
do good work or to write good papers. There are many better motives for doing
research than the hope of winning a prize. For me, a strong motive for
research is quite simply that it's a fun and exciting thing to do. I try to
write clear papers because I want to communicate what I've done. Prizes
substitute an external reward in place of internal motivation. Although I
don't think it's happened in AI yet, it is easy to point to other fields where
real problems have occurred because winning a prize became the focus rather
than the process of doing science.
Of course prizes are not the goal. And these prizes are certainly not
big enough (like the Nobel Prize) to become the focus of the science.
But it is useful to have role models of what it means to do excellent
science, and it is nice for people who do excellent science to have that
recognized by their peers.
Some possible solutions:
1. Do away with prizes
-assume that people will find out about good writing in the
proceedings in the same way that they find out about good
writing in journals: by reading it themselves or having it
recommended by colleagues.
But my colleagues, in any particular place, will often be just those I
talk to anyway, and will have both the local biases, and usually not the
knowledge to judge papers in areas out of the local mainstream subfield.
2. Highlight excellent papers during the summary session
If we have summary sessions at AAAI (as at IJCAI-89) the summarizers could
highlight papers that were particularly good, and what was interesting about
them. The papers could be selected by the area subcommittee. The advantages
of this approach are: 1) it is a lower key way of pointing out good work, 2)
if several papers are of high quality they all can be mentioned, and 3) by
stating the reasons for selecting the paper it can be cast in the context of
other work going on in the area.
This is an excellent idea, and might be pursued independent of the
decision on whether or not to have prizes. I also think that a brief
writeup by the summarizer in the proceedings would serve both for people
who were not at the sumary session, and a reminder of the contents of
that session when you pick up the proceedings six months later.
3. A variant on 2 would be to do everything in 2 and in addition, for each
area, select one particularly accessible paper for presentation at a plenary
session of the conference.
This would satisfy the goals above. How would such papers be distinguished (would
we call them "prize papers"?)
I appreciate the level and tone of the discussion. I think we all agree
that what we want is a useful, informative conference, and a healthy field,
and only open discussion of contentious issues can keep it that way.
-------
-------
Message 2 -- ************************
Posted-Date: Fri, 22 Dec 89 09:48:52 PST
Received-Date: Fri, 22 Dec 89 11:54:42 -0800
Received: from relay.cs.net by vaxa.isi.edu (5.61/5.61)
id AA23672; Fri, 22 Dec 89 11:54:42 -0800
Received: from relay2.cs.net by RELAY.CS.NET id ad27260; 22 Dec 89 13:54 EST
Received: from ed.aaai.org by RELAY.CS.NET id aa22270; 22 Dec 89 14:50 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA20007; Fri, 22 Dec 89 09:43:15 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA16709; Fri, 22 Dec 89 09:48:52 PST
Date: Fri, 22 Dec 89 09:48:52 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <8912221748.AA16709@nilsson.aaai.org>
To: SWARTOUT@VAXA.ISI.EDU, bobrow.pa@XEROX.COM,
hes@scrc.vallecito.symbolics.com
Subject: Re: Prizes at AAAI
I've been thinking alot about the prize issue. I would like to see
us think differently about the prize.
It is important to think of ways to demonstrate the usefulness of
AI techniques in large scale systems. As you well know, AI has
the reputation of its inability to be integrated into large, data-driven
systems and therefore show its uselessness. I think we need to look at
this issue and find a way of communicating to the rest of the AI community
and the public that this perception is false with examples. I don't
think the IAAI conference is the place for this discussion just yet;
it will not get the large number of attendees and press as NCAI for
a number of years.
The C&T award analog is the right approach rather than some publishers'
prize. I suggest that we transfer the publishers' prize to AAAI Press
and have the winner(s) of the prize write expanded papers. T
I suggest we call it the AAAI Press Prize. This idea
will cut into AI Journal's tradition of publishing expanded papers.
Claudia
-------
Message 3 -- ************************
Posted-Date: Fri, 22 Dec 89 18:09 PST
Received-Date: Fri, 22 Dec 89 18:18:44 -0800
Received: from Xerox.COM by vaxa.isi.edu (5.61/5.61)
id AA02103; Fri, 22 Dec 89 18:18:44 -0800
Received: from Semillon.ms by ArpaGateway.ms ; 22 DEC 89 18:16:32 PST
Date: Fri, 22 Dec 89 18:09 PST
From: bobrow.pa@Xerox.COM
Subject: Re: Prizes at AAAI
To: mazzetti@ed.aaai.org
Cc: SWARTOUT@VAXA.ISI.EDU, bobrow.pa@Xerox.COM,
hes@scrc.vallecito.symbolics.com
In-Reply-To: <8912221748.AA16709@nilsson.aaai.org>
Message-Id: <19891223020921.7.BOBROW@BULLWINKLE.parc.xerox.com>
Line-Fold: no
Date: Fri, 22 Dec 89 09:48:52 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
I've been thinking alot about the prize issue. I would like to see
us think differently about the prize.
It is important to think of ways to demonstrate the usefulness of
AI techniques in large scale systems. As you well know, AI has
the reputation of its inability to be integrated into large, data-driven
systems and therefore show its uselessness. I think we need to look at
this issue and find a way of communicating to the rest of the AI community
and the public that this perception is false with examples. I don't
think the IAAI conference is the place for this discussion just yet;
it will not get the large number of attendees and press as NCAI for
a number of years.
Perhaps the AAAI should find some mechanism to offer a systems prize. The
issue is finding an appropriate mechanism for deciding on the prize winners.
The C&T award analog is the right approach rather than some publishers'
prize. I suggest that we transfer the publishers' prize to AAAI Press
and have the winner(s) of the prize write expanded papers. T
I suggest we call it the AAAI Press Prize. This idea will cut into AI
Journal's tradition of publishing expanded papers.
I am not quite sure what you are suggesting. If what you mean is that
the name on the prize(s) should be AAAI press, rather than Publisher's
Prizeor the AIJ Prize, then this is not a big deal. Given AIJ's
intimate relation with AAAI, I am would think they would be glad to
continue to fund the prize(s) anonymously, and have the AAAI Press take
the publicity.
As for what to do with the expanded papers, I assume you are talking
about putting out a book of all the papers. The AIJ is not hurting for
submissions so it is not a conflict of needs. (The AIJ often gets
expanded papers before the conference and the quality of submissions is
generally quite high.) There may be an issue about what is more useful
to the authors. Publication as a refereed journal article counts
significantly more than as a chapter in a book for tenure. Forcing best
papers into a book may be a disincentive. But rapid publication may be
compensation. Authors should have some choice. But if you don't get enough
to fill, ...
-------
Message 4 -- ************************
Posted-Date: Wed, 27 Dec 89 14:55:15 PST
Received-Date: Wed, 27 Dec 89 14:56:21 -0800
Received: from arisia.Xerox.COM by vaxa.isi.edu (5.61/5.61)
id AA23629; Wed, 27 Dec 89 14:56:21 -0800
Received: from kanga.parc.Xerox.COM by arisia.Xerox.COM with SMTP
(5.61+/IDA-1.2.8/gandalf) id AA01383; Wed, 27 Dec 89 14:50:47 -0800
Received: by kanga.parc.xerox.com
(5.61+/IDA-1.2.8/gandalf) id AA14480; Wed, 27 Dec 89 14:55:15 PST
Message-Id: <8912272255.AA14480@kanga.parc.xerox.com>
Date: Wed, 27 Dec 89 14:55:15 PST
From: Pat Hayes <hayes@parc.xerox.com>
To: bobrow.pa@Xerox.COM
Cc: SWARTOUT@VAXA.ISI.EDU, hes@VALLECITO.SCRC.SYMBOLICS.COM, tgd@CS.ORST.EDU,
bobrow.pa@Xerox.COM, mazzetti@ed.aaai.org
In-Reply-To: bobrow.pa@Xerox.COM's message of Fri, 22 Dec 89 11:05 PST <19891222190552.3.BOBROW@BULLWINKLE.parc.xerox.com>
Subject: Prizes at AAAI
Some more thoughts after Dannys responses to Bill. I also tend to
dislike prizes, but if they are seen as something useful and even an
emerging tradition ( like the Turing award ) then by all means lets
let them continue. But I would question some of the arguments being
made in their favor. Especially, I dont think they do serve as models
for younger researchers to emulate, and in any case, I dont like the
tone which this gives the conference. We should be trying to be more
like a meeting of professionals, and less like a nursery school.
Dannys 3 and 4 seem almost meaningless to me ( one could argue that
the prizes actually emphasise the subfield-splitting: and the
committee already has to look at lots of stuff across many areas, and
if they want to do it more thay can do it in private ). This leaves
the issue of recognition being useful to the individuals, which seems
to me to be one good argument in their favor. But, some years there
are more good pieces of work than in other years. So should we always
award just one prize? ( The answer has to be yes, because the dangers
of allowing it to vary are too great, but then this is somewhat unfair
to some individuals. )
On the publishers prize. Bill has a valid point, and Dannys answer
doesnt address it. If there are two criteria of excellence, than its
sometimes impossible to optimise on both of them. If we have a
beautifully written paper which is essentially a survey ( Im
thinking of Graeme Hirsts paper in Krep 89 ) and a tolerably written
but technically dense paper which reports on a truly new, excellent
piece of work, which way should the penny fall? I take it that Bills
sense is that the survey should get the publishers prize, but that the
tradition is pointing in the other direction. I agree, and think that
this is a pity, as a prize for literary merit might indeed be fun. Of
course, the work has to be at least acceptable, but then if it wasnt
it shouldnt have been accepted into the conference at all, right? We
have to be careful not to imply that some of the accepted papers arent
really acceptable.
Danny says 'the losers havnt lost anything which not having prizes
would give them back.' I disagree. To have been in the running for a
prize and to have lost it is definitely a worse position to be in than
to simply not be competing. Which suggests an idea: let people enter
themselves for the best-paper competition at the time of submission.
It can be a simple check-box on the submission form: "Do you want this
paper to be considered for the best-paper award? Yes/No". And then
the committee only considers the ones which have been entered. ( In
case you are wondering, I predict that if we did this the whole system
would become unworkable quite quickly, a fact which reveals many of
the true difficulties with prize-giving. )
I also like Bills summary-session idea. It worked well at IJCAI, and
it could become an excellent tradition, which would make it
self-strengthening, as people would take it seriously enough to give
it a lot of their attention, and the presenter would give it more
work. Also, if the commentator has some idiosyncratic perspective of
his/her own, this would be fairly acceptable, I think, as it would be
clear who is giving the opinions.
Sorry to be so negative, but I really dont like prizes. It reminds me
of school: and even then, I used to wonder what gave those bozos the
authority to make such judgements.
Pat
-------
Message 5 -- ************************
Posted-Date: Wed 27 Dec 89 16:24:53-PST
Received-Date: Wed, 27 Dec 89 16:25:40 -0800
Received: from pluto.arc.nasa.gov by vaxa.isi.edu (5.61/5.61)
id AA25404; Wed, 27 Dec 89 16:25:40 -0800
Date: Wed 27 Dec 89 16:24:53-PST
From: Peter Friedland <FRIEDLAND@PLUTO.ARC.NASA.GOV>
Subject: AAAI goings on
To: swartout@vaxa.isi.edu
Message-Id: <630807893.0.FRIEDLAND@PLUTO.ARC.NASA.GOV>
Mail-System-Version: <VAX-MM(228)+TOPSLIB(132)+PONY(228)@PLUTO.ARC.NASA.GOV>
Bill,
Sorry we didn't connect today. Monte, Tom, and I went over the current state
of affairs re speakers and panels. The next message to you will explain
what we decided. I am also soliciting the area chairs again for further
suggestions.
I read your stuff on prizes. Good arguments on both sides. I faced the same
thing in our group recently where I proposed a set of awards (that I would
spring for) to be given to people voted by their peers in the group deserved
recognition. 1/3 thought it was great, 1/2 were ho hum, remainder were
strongly opposed for much the same reasons you gave. My own feeling is that
prizes like the aaai prize are generally to the good. I don't think they
create much (bad) competition before the fact. What happens is that somebody
wins, he/she feels very good, his/her friends and a decent number of others
think it's great, his/her enemies and a smaller number of others decide it
was all politics, and lots are sort of "so what" I believe our field could
use some more competition. Certainy there is FAR less than in hard sciences
like physics or chemistry where groups are actually racing to discover natures
secrets. If somebody wants to put up some $ that some reasonably fair process
hands out, I tend to feel "what's the harm."
The issue of giving a good talk is an important one. How do we ensure the
same for the C&T award? Or for the president's lecture for that matter.
Generally those two awards are given to reasonably seasoned speakers, but
even they can be lemons. I think the chair of the prize paper panel should
have the responsibility to help ensure quality of the talk after the paper
is chosen.
Just some random thoughts. The world will not stop turning either way, but
if forced to choose I would cast my vote toward continuing the awards even
though because of petty politics I haven't won one yet!
Peter
-------
-------
Message 6 -- ************************
Posted-Date: Fri, 29 Dec 89 13:30 EST
Received-Date: Fri, 29 Dec 89 10:31:02 -0800
Received: from VALLECITO.SCRC.SYMBOLICS.COM by vaxa.isi.edu (5.61/5.61)
id AA05036; Fri, 29 Dec 89 10:31:02 -0800
Received: from MERLIN.SCRC.Symbolics.COM by VALLECITO.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 323560; Fri 29-Dec-89 13:32:46 EST
Date: Fri, 29 Dec 89 13:30 EST
From: Howard Shrobe <hes@VALLECITO.SCRC.Symbolics.COM>
Subject: Prizes at AAAI
To: SWARTOUT@VAXA.ISI.EDU, hes@VALLECITO.SCRC.Symbolics.COM, tgd@CS.ORST.EDU,
bobrow.pa@XEROX.COM, mazzetti@ed.aaai.org
In-Reply-To: <630348913.0.SWARTOUT@VAXA.ISI.EDU>
Message-Id: <19891229183006.2.HES@MERLIN.SCRC.Symbolics.COM>
Date: Fri 22 Dec 89 08:55:13-PST
From: Bill Swartout <SWARTOUT@VAXA.ISI.EDU>
Danny, Tom, Howie and Claudia,
Well, let me throw my two cents in.
First, my personal bias is against giving prizes. Danny's argues that
if you don't win a prize then you're no worse off than if there were no
prizes at all, seems grossly untrue to me. It is often very
discouraging to be in a position where you feel that your work is
noteworthy only to witness somebody else getting the best paper prize
for work that seems no better (or even worse) than your own.
Of course, for most people this effect is transient. On the other hand,
I doubt that the best paper prize does very much to encourage good work
or clear writing since there are other pressure systems in place (tenure
in particular) which exercise considerably greater force.
So either prizes have no effect, or they have the effect of depressing
all the authors of the top 10% of the papers other than the few people
who get a prize. I am concerned about this demotivating factor of
prizes. Bill has a personal story about this that he can tell.
Second, as a practical suggestion, I think that should we look over all
the prize papers since we started giving prizes and ask ourselves
retrospectively whether each paper deserved a prize. If our batting
average is low, then clearly there's too much noise in the system. I
can certainly remember prize winning papers (even those by friends
of mine) which at the time I thought would had no lasting impact; for
those I remember, time has not proven me wrong.
-------
-------
-------
----- End Forwarded Message -----
----- End Forwarded Message -----
∂22-Jan-90 1509 LOGMTC-mailer Hughes seminar
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 90 15:09:35 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04271; Mon, 22 Jan 90 15:09:58 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA02894; Mon, 22 Jan 90 14:48:05 PST
Message-Id: <9001222248.AA02894@iswim.stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: Hughes seminar
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Mon, 22 Jan 90 14:47:54 PST
Sender: jcm@iswim.Stanford.EDU
sorry about the delay...
----- Transcript of session follows -----
While talking to Sail.Stanford.EDU:
>>> RCPT To:<logmot@sail.stanford.edu>
<<< 550 I don't know anybody named logmot
550 <logmot@sail.stanford.edu>... User unknown
Speaker: Prof. John Hughes, Glasgow
Time: 4 PM
Room: 252 Margaret Jacks Hall
Title: Strictness Analysis of Higher-order Polymorphic Functions
Abstract:
Type information has proved to be valuable for a semantic analyser
such as a strictness analyser, but the best way to make use of
polymorphic type information is not yet clear. My thesis is that
the categorical properties of polymorphic functions are a good basis
for strictness analysis. In previous work I've concentrated on
first order functions, which are natural transformations, and
developed methods for this case. Today I'll talk about work in
progress to analyse higher-order functions based on Wadler's
"Theorems for Free".
∂22-Jan-90 1523 LOGMTC-mailer Hughes seminar
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 90 15:09:35 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04271; Mon, 22 Jan 90 15:09:58 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA02894; Mon, 22 Jan 90 14:48:05 PST
Message-Id: <9001222248.AA02894@iswim.stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: Hughes seminar
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Mon, 22 Jan 90 14:47:54 PST
Sender: jcm@iswim.Stanford.EDU
sorry about the delay...
----- Transcript of session follows -----
While talking to Sail.Stanford.EDU:
>>> RCPT To:<logmot@sail.stanford.edu>
<<< 550 I don't know anybody named logmot
550 <logmot@sail.stanford.edu>... User unknown
Speaker: Prof. John Hughes, Glasgow
Time: 4 PM
Room: 252 Margaret Jacks Hall
Title: Strictness Analysis of Higher-order Polymorphic Functions
Abstract:
Type information has proved to be valuable for a semantic analyser
such as a strictness analyser, but the best way to make use of
polymorphic type information is not yet clear. My thesis is that
the categorical properties of polymorphic functions are a good basis
for strictness analysis. In previous work I've concentrated on
first order functions, which are natural transformations, and
developed methods for this case. Today I'll talk about work in
progress to analyse higher-order functions based on Wadler's
"Theorems for Free".
∂22-Jan-90 1643 ingrid@russell.Stanford.EDU Seminar on Computers, Design, and Work - 1/24/1990
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 90 16:43:53 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA05696; Mon, 22 Jan 90 15:57:53 PST
Date: Mon, 22 Jan 90 15:57:53 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001222357.AA05696@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Seminar on Computers, Design, and Work - 1/24/1990
SEMINAR ON COMPUTERS, DESIGN, AND WORK
The Architecture of an "Open HyperDocument System"
Douglas Engelbart
Wednesday, 24 January, 12:15
Ventura 17
Douglas Engelbart is currently developing his "bootstrap project" here
at Stanford. Here are some quotes from his notes:
In particular, I want to discuss an "open hyperdocument system"
(OHS): where the hyperdocuments are embedded within an open (and
integrated) information-system environment, and where the combined
functionality is available to employ within the knowledge-work
domains of every class of worker (working from any vendor's
terminal/workstation of suitable capability). Under these
condidtions, the role and value of hyperdocuments within groups, and
between groups, offers very significant improvements in the
productive harnessing of human minds...
The full achievement of these gains awaits two things:
(1) widespread implementation of integrated, open-system
architectures; and
(2) widespread adoption of new knowledge-work processes (or,
"knowledge processes")...
The following week (1/31), Bryan Pfaffenberger will speak on social
aspects of expert systems.
∂22-Jan-90 1650 cutkosky@cnc-sun.Stanford.EDU C.S. 329/ M.E. 390 schedule
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 90 16:50:00 PST
Received: from cnc-sun.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Mon, 22 Jan 90 16:40:31 PST
Received: by cnc-sun.Stanford.EDU (4.0/inc-1.0)
id AA03043; Mon, 22 Jan 90 16:42:32 PST
Date: Mon, 22 Jan 90 16:42:32 PST
From: cutkosky@cnc-sun.Stanford.EDU (Mark Cutkosky)
Message-Id: <9001230042.AA03043@cnc-sun.Stanford.EDU>
To: cis-building@glacier.stanford.edu, ee-faculty@sierra.stanford.edu,
iclabusers@glacier.stanford.edu
Subject: C.S. 329/ M.E. 390 schedule
A.I. in Design and Manufacturing
ME290/C.S. CS329
Profs. Mark R. Cutkosky (ME) and Jay M. Tenenbaum (CS)
(The course will convene on Mondays from 5:45 to 7:00 in
Skilling Aud. The first 45-60 minutes will be televised by SITN.
The remainder will be off-air discussion.)
----
This seminar will feature speakers from academia and industry
discussing their work on applying A.I. techniques and programming
methodologies to the design and manufacturing of products. The focus
will be interdisciplinary, stressing common issues involved in
building systems for the design and manufacture of mechanical,
electronic and structural artifacts. Issues to be covered include:
representing and reasoning about designs (function, behavior, form),
design processes, and manufacturing processes; codification of large
amounts of engineering knowledge; and AI tools that support emerging
methodologies such as concurrent engineering, team design, and rapid
prototyping. Students can elect to take the seminar for either 1 or 3
units of credit. The latter will require completion of an individual
or team programming project in conjunction with ongoing research at
SIMA or CIS and will be subject to approval of the instructors.
Course Schedule:
Jan 15 Martin Luther King Day (no classes)
Jan 22 Course Introduction &
J. M. Tenenbaum, Schlumberger Technologies and C.S. Dept., Stanford.
Discussion title: "Enterprise Computing"
Jan 29 M. R. Cutkosky, Mech. Eng. Dept., Stanford
Discussion title: "Next-Cut: a system for concurrent design"
T. Gruber, Knowledge Systems Lab
Discussion title: "Device Modeling"
Feb 5 R. Levitt, Civil Eng. Dept, Stanford
Discussion title: "to be announced"
Feb 12 K. Kempf, Intel
Dicussion title: "Artificial Intelligence Techniques applied to
Manufacturing Production Scheduling"
Feb 19 No classes
Feb 26, S. Mittal, Xerox PARC
Dicussion title: "Towards a theory of configuration design"
Mar 5 B. Hayes-Roth, KSL
Discussion Title: "Real-time monitoring, diagnosis and control"
Mar 12 T. Winograd, CSLI
Discussion Title: "Automation and augmentation
-- who has the knowledge?"
∂22-Jan-90 2043 forbus@cs.uiuc.edu prize paper award - part 1 of 2
Received: from p.cs.uiuc.edu by SAIL.Stanford.EDU with TCP; 22 Jan 90 20:42:55 PST
Received: by p.cs.uiuc.edu
(5.61+/IDA-1.2.8) id AA03094; Mon, 22 Jan 90 22:29:51 -0600
Date: Mon, 22 Jan 90 22:29:51 -0600
From: Kenneth Forbus <forbus@cs.uiuc.edu>
Message-Id: <9001230429.AA03094@p.cs.uiuc.edu>
To: mazzetti@ed.aaai.org
Cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
hart@KL.SRI.COM, hector@ai.toronto.edu,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU, nilsson!mazzetti
Subject: prize paper award - part 1 of 2
I agree with Bill and Pat and Howie. I think the prizes shed more
heat than light. And the nominating process has been very uneven,
with some areas much more prone to nominate work than others,
independent of quality.
To me, the summary sessions have a much better effect in increasing
communication across areas. If you want to show newcomers exemplary
papers, why should they be current papers? Pick time-proven classics,
it has the same tutorial effect without the disadvantages (I have my
students comb the M/K Readings books for exemplars).
Sure, prizes sizzle, and make a good source of gossip. But, really,
isn't getting a paper into a conference with an 80% rejection rate
enough of a distinction? People have plenty to talk about without
having prizes.
BTW, If we decide to continue having prizes, I do think there is an
important modificaton that should be made. It should be a rule that
members of the program committee are NOT ELIGABLE to be nominated. (I
tried to get this through when Howie and I did AAAI-87, but was
overruled.) I have yet to hear an argument against this position
which doesn't presume that the field is about an order of magnitude
smaller than it actually is. In the past we have had situations that
were positively embarassing in appearance, no matter what the
underlying reality was. For heaven's sake, Ineligability for prizes
is standard for nominating committees in organizational life (as is
bad spelling, sorry), why do we think we are so exceptional?
∂23-Jan-90 1210 grundy@csli.Stanford.EDU Forum room change
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Jan 90 12:10:33 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA02147; Tue, 23 Jan 90 12:07:11 PST
Date: Tue 23 Jan 90 12:07:10-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Forum room change
To: grundy@csli.Stanford.EDU
Message-Id: <633125230.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
A quick note about the Symbolic Systems Forum. Room scheduling originally
re-assigned the forum to room 60-62A this quarter. I have sent out several
announcements mentioning the new room already. However, yesterday it was
determined that, in fact, we will be having the forum in the old room, 60-61G.
Please disregard the earlier notices telling you about the room change.
The time change, however, remains -- we will meet on Thursdays at 4:15 pm
this quarter.
Please plan to attend this week's forum:
SYMBOLIC SYSTEMS FORUM
Thursday, January 25, 1990
Building 60, Room 62-A, 4:15 pm
Speaker: John Dupre
Topic: "Conversations with Apes: Reflections on the
Scientific Study of Language"
ABSTRACT
--------
In this talk I will look at some of the different
attempts that have been made to teach symbolic systems,
including American sign language, to various apes. I'll
also discuss the main criticisms that have been directed
against these attempts. I shall argue that these criticisms
reveal serious conflicts between assumptions about correct
scientific methodology and the very possibility of the kind
of research project envisaged by the ape language
researchers. Finally I shall offer a few suggestions about
why this research and its evaluation has seemed so important
to some people.
-------
∂24-Jan-90 1627 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU minimizing sum of k largest linear functions
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:26:31 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA26306; Wed, 24 Jan 90 03:40:36 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08897; Wed, 24 Jan 90 03:40:25 -0800
Message-Id: <9001241140.AA08897@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6472; Wed, 24 Jan 90 04:28:27 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6425; Wed, 24 Jan 90 04:27:23 CST
Date: Wed, 24 Jan 90 02:20:45 CST
Reply-To: Farid Alizadeh <alizadeh%UMN-CS.CS.UMN.EDU@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Farid Alizadeh <alizadeh%UMN-CS.CS.UMN.EDU@VM1.NoDak.EDU>
Subject: minimizing sum of k largest linear functions
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Let S be a set of m linear functions over R↑n:
S={(a_i,x) + b_i | a_i and x are n-vectors, b_i a real
number, 1 <= i <= m }
where (x,y) is the inner product of two vectors.
Define the function f_k : R↑n -> R where
f_k(x)= sum of the k largest functions in S when evaluated at x.
We want to compute min f_k(x).
Now it is easy to show that f_k(x) is a convex function and clearly can be
computed for any x. Therefore, one can use the ellipsoid method and compute
the minimum in polynomial time. Are there better methods?
Note that for k=1 one can easily transform the problem into a linear program
by introducing a new variable z. So, for k=1 the problem is equivalent to
the following linear program with m constraints:
minimize z
subject to z - (a_i,x) - b_i >= 0 for 1 <= i <= m
Of course, similar transformation for k in general will yield C(m,k) (m choose
k) constraints and so will not be polynomial.
My question is: are there good algorithms other than the ellipsoid method for
this problem? I would accept a simplex type method as an efficient method. How
about interior point methods? Can we transform this problem to one with
few (polynomially bounded in n,m and k) number of constraints? Would it help
to look at the dual?
∂24-Jan-90 1629 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Suggestions needed
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:28:18 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15894; Wed, 24 Jan 90 02:28:29 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04802; Wed, 24 Jan 90 02:28:12 -0800
Message-Id: <9001241028.AA04802@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6332; Wed, 24 Jan 90 04:26:47 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6299; Wed, 24 Jan 90 04:26:44 CST
Date: Wed, 24 Jan 90 02:20:30 CST
Reply-To: Robert Maltas <maltasr%csusac.csus.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Robert Maltas <maltasr%csusac.csus.edu@VM1.NoDak.EDU>
Subject: Suggestions needed
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
My work involves the efficient allocation of parallel memories in a computer.
To simplify the work, I make the over-simplification of memory as being
a 2-dimensional resource (since n-processors, each with n-single dimensional
arrays, when taken together, approximate 2-dimensional memory).
Here is the problem:
I have about 100 different types of patterns. For example, here is one pattern:
#########
# # I labeled the interior of this pattern
# # with the x-y coordinate system. Now,
# (1,0) # for this + pattern, I associate it with
# # the number 5 (not because it has 5 blocks
# # in the pattern, but for totally different
######################### reasons).
# # # #
# # # # Thus, each different pattern has a certain
# (0,1) # (1,1) # (2,1) # number associated with. Some different
# # # # patterns also have the same number
# # # # associated with them. For example, let's
######################### say an L-shaped pattern made of 3 blocks
# # has the same number (for example, 4)
# # associated with it as a square consisting of
# (1,2) # 9 blocks.
# #
# # Given these different shapes with each shape
######### associated with a certain number, what software/
mathematical-type analysis/etc do I need to
establish a correlation between a shape and a number. That is, I need to
determine what characteristic(s) is (are) common between the shapes and the
numbers-----what factor is it that all the shapes associated with the number
8 (for example) have that determine that they must be associated with 8------
is it the area, something about their external perimeters, etc.r
What tools are available at ftp-sites or on the UNIX system to help me
analyze this data. I envision using the coordinates (like I placed in the
example above) for each shape and the associated number for each shape,
and place this data in some type of table, and then run the programs
you suggest (as a start).
Thanks for the time.
--
///
\\\/// UUCP : {ucdavis|lll-crg}!csusac!maltasr
\XX/ Internet: maltasr@csusac.csus.edu
∂24-Jan-90 1631 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parallel graph reduction and combinators
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:30:17 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12484; Wed, 24 Jan 90 00:38:02 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02567; Wed, 24 Jan 90 00:37:33 -0800
Message-Id: <9001240837.AA02567@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5172; Wed, 24 Jan 90 02:33:09 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3489; Wed, 24 Jan 90 02:33:06 CST
Date: Tue, 23 Jan 90 22:40:12 CST
Reply-To: sreedhar%longhair.cs.unlv.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: sreedhar%longhair.cs.unlv.edu@VM1.NoDak.EDU
Subject: parallel graph reduction and combinators
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Hi,
i am posting this request the second time. i think i made a mistake
posting the first time.
I need some information on PGR and combinators:
1. bibiliography
2. some open problems
3. address of active reseachers and there institutes
4. source code of systems implemented using this techniques.
thank you very much
∂24-Jan-90 1627 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Computer Science Logic - Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:27:02 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AB26329; Wed, 24 Jan 90 03:42:00 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08941; Wed, 24 Jan 90 03:40:49 -0800
Message-Id: <9001241140.AA08941@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6552; Wed, 24 Jan 90 04:28:42 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6534; Wed, 24 Jan 90 04:27:38 CST
Date: Wed, 24 Jan 90 02:20:56 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Moshe Vardi <VARDI@ALMVMA.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Moshe Vardi <VARDI%ALMVMA.BITNET@VM1.NoDak.EDU>
Subject: Computer Science Logic - Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CSL'90
Computer Science Logic
October 1-5, 1990
Heidelberg, West Germany
First Announcement
and
CALL FOR PAPERS
The fourth workshop on Computer Science Logic will be held from Monday,
October 1, to Friday, October 5, 1990, in Heidelberg (West Germany).
This is the fourth in a series of workshops on concepts and methods of
logic which are relevant for computer science. The first three
workshops took place in Karlsruhe (1987), in Duisburg (1988) and in
Kaiserlautern (1989). Both, computer scientists whose research
activities involve logic and logicians working on algorithmic
aspects of logical problems, are invited to attend the workshop.
The scientific program will consist of invited lectures and of short
contributions which will be selected from the submitted papers. All
contributions will be refereed for a proceedings volume.
An extended abstract (1-2 pages) of submitted papers should be sent to
the program committee chairman (W. Schoenfeld) not later than June 1,
1990. The authors will be notified of acceptance for presentation to
the workshop by July 15, 1990. The preliminary version of the complete
paper should be ready for the workshop. The final camera-ready versions
of the paper for inclusion in the workshop proceedings will be due
December 1, 1990.
By January 15, 1991, the authors will be notified of acceptance of their
papers for the proceedings volume.
The conference fee is DM 80,--.
Program Committee and Organizers: E. Boerger (Pisa/Heidelberg)
H. Kleine Buening (Duisburg)
M.M. Richter (Kaiserslautern)
W. Schoenfeld (Heidelberg)
Program Committee Chairman: W. Schoenfeld
Correspondence should be sent to:
Prof. Dr. Wolfgang Schoenfeld
IBM Deutschland GmbH
Wissenschaftliches Zentrum
Postfach 10 30 68
6900 Heidelberg
Federal Republic of Germany
∂24-Jan-90 1628 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Positions at Ecole Normale Superieure de Lyon
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:27:30 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15976; Wed, 24 Jan 90 02:30:14 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04840; Wed, 24 Jan 90 02:28:44 -0800
Message-Id: <9001241028.AA04840@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6391; Wed, 24 Jan 90 04:27:07 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6361; Wed, 24 Jan 90 04:27:05 CST
Date: Wed, 24 Jan 90 02:20:39 CST
Reply-To: Michel Cosnard <cosnard%ensl.ens-lyon.fr@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Michel Cosnard <cosnard%ensl.ens-lyon.fr@VM1.NoDak.EDU>
Subject: Positions at Ecole Normale Superieure de Lyon
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
PROFESSOR OF COMPUTER SCIENCE
Ecole Normale Superieure de Lyon, France
The Computer Science Department of the Ecole Normale Superieure de Lyon
is seeking two computer scientists for permanent positions as:
- an asociate professor
- an assistant professor
Strong research and teaching ability and a PhD in any area
of Computer Science are required. Domain research in connection with
parallelism is preferred.
The Ecole Normale Superieure de Lyon is a high-level school whose students
are selected nationwide. They enter the school when beginning their third
undergraduate year. The department offers BS, MS and Ph.D in Computer
Science.
The Research laboratory is oriented towards all aspects of parallelism
in Computer Science. It is associated with the French Council for
Research and offers excellent research facilities. The lab includes
3 professors and 8 assistant professors and around 15 PhD students.
Please e-mail resume and list of publications to cosnard@frensl61.bitnet
or cosnard@ensl.ens-lyon.fr. Note that deadline for application is
February 20, 1990.
∂24-Jan-90 1633 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STOC 1990
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:31:44 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12684; Wed, 24 Jan 90 00:43:30 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02627; Wed, 24 Jan 90 00:41:29 -0800
Message-Id: <9001240841.AA02627@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5507; Wed, 24 Jan 90 02:35:52 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3851; Wed, 24 Jan 90 02:33:33 CST
Date: Tue, 23 Jan 90 22:40:45 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Hal Gabow <hal@boulder.Colorado.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Hal Gabow <hal%boulder.Colorado.EDU@VM1.NoDak.EDU>
Subject: STOC 1990
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Here is the Preliminary Version of the Technical Program for
STOC 1990.
Authors of previous STOC and FOCS papers are reminded of the
Erratum Section to appear in the STOC 1990 Proceedings. To
submit material for this section please contact Hal Gabow
(hal@boulder.colorado.edu). All material for the Proceedings is
due March 12. See FOCS 1987 for a description of the Erratum
Section.
---------------------------------------------------------------
Preliminary Technical Program, STOC 1990
Monday, May 14, 1990
Session 1 8:30-10:10
Ian Munro
BLASTING Through the Information Theoretic Barrier with FUSION TREES
Michael L. Fredman, Rutgers, Bellcore and UCSD;
Dan E. Willard, SUNY at Albany.
On the Dynamic Finger Conjecture for Splay Trees
Richard Cole, Courant Institute.
Unique Binary Search Tree Representations and Equality-testing of
Sets and Sequences
Rajamani Sundar, Courant Institute; Robert E. Tarjan, Princeton University
and AT&T Bell Laboratories.
The Information Theory Bound is Tight for Selection in a Heap
Greg N. Frederickson, Purdue University.
Lower Bounds for the Union-find and the Split-find Problem on
Pointer Machines
J. A. La Poutre', University of Utrecht.
Break 10:10-10:30
Session 2 10:30-12:10
Manfred Warmuth
Optimal Randomized Algorithms for Local Sorting and Set-maxima
Wayne Goddard, Leonard Schulman, Massachusetts Institute of Technology;
Valerie King, University of Toronto.
On the Necessity of Occam Algorithms
Raymond Board, Leonard Pitt, University of Illinois, Urbana.
Learning Boolean Functions in an Infinite Attribute Space
Avrim Blum, Massachusetts Institute of Technology.
Self-testing and Self-correcting Programs with Applications to
Numerical Problems
Manuel Blum, Ronitt Rubinfeld, University of California, Berkeley;
Michael Luby, International Computer Science Institute.
Coherent Functions and Program Checkers
Andrew C. Yao, Princeton University.
Lunch 12:10-1:30
Session 3 1:30-3:10
Baruch Awerbuch
The Use of a Synchronizer Yields Maximum Computation Rate in
Distributed Networks
Shimon Even, Technion; Sergio Rajsbaum, University of Texas at Dallas.
The Wakeup Problem
Michael J. Fischer, Gadi Taubenfeld, Yale University;
Shlomo Moran, Technion; Steven Rudich, Carnegie Mellon University.
How to Distribute a Dictionary in a Complete Network
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide,
University of Paderborn.
Computing with Unreliable Information
Uriel Feige, David Peleg, Weizmann Institute of Science;
Prabhakar Raghavan, IBM T.J. Watson Research Center;
Eli Upfal, IBM Almaden Research Center and Weizmann.
Efficient Robust Parallel Computations
Zvi M. Kedem, Courant Institute; Krishna Palem, IBM T.J. Watson
Research Center; Paul Spirakis, Patras University and Courant.
Break 3:10-3:30
Session 4 3:30-5:10
John Reif
On-line Algorithms for Path Selection in Nonblocking Networks
Sanjeev Arora, Tom Leighton, Bruce Maggs,
Massachusetts Institute of Technology.
Optimal Disk I/O with Parallel Block Transfer
Jeffrey S. Vitter, Brown University;
Elizabeth A.M. Shriver, Bell Communications Research.
Deterministic Sampling - A New Technique for Fast Pattern Matching
Uzi Vishkin, University of Maryland and Tel Aviv University.
Towards Overcoming the Transitive-closure Bottleneck: Efficient
Parallel Algorithms for Planar Digraphs
Ming-Yang Kao, Duke University; Philip N. Klein, Brown University.
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube
and Related Computers
Robert Cypher, IBM Almaden Research Center;
C. Greg Plaxton, Massachusetts Institute of Technology.
Tuesday, May 15, 1990
Session 5 8:30-10:10
Dexter Kozen
Pseudorandom Generators for Space-bounded Computation
Noam Nisan, Massachusetts Institute of Technology.
Small-bias Probability Spaces: Efficient Constructions and
Applications
Joseph Naor, Stanford University; Moni Naor, IBM Almaden Research Center.
The Analysis of Closed Hashing Under Limited Randomness
Jeanette P. Schmidt, Polytechnic University, Brooklyn;
Alan Siegel, Courant Institute.
The Computational Complexity of Universal Hashing
Yishay Mansour, Noam Nisan, Massachusetts Institute of Technology;
Prasoon Tiwari, IBM T.J. Watson Research Center.
Not All Keys Can Be Hashed in Constant Time
Joseph Gil, Avi Wigderson, Hebrew University;
Friedhelm Meyer auf der Heide, University of Paderborn.
Break 10:10-10:30
Session 6 10:30-12:10
Janos Simon
A Technique for Lower Bounding the Cover Time
David Zuckerman, University of California, Berkeley.
Approximate Inclusion-exclusion
Nati Linial, IBM Almaden Research Center, Stanford University, Hebrew
University; Noam Nisan, Massachusetts Institute of Technology.
Towards Optimal Simulations of Formulas by Bounded-width Programs
Richard Cleve, International Computer Science Institute.
Functions with Bounded Symmetric Communication Complexity and
Circuits with mod m Gates
Mario Szegedy, Hebrew University.
Monotone Circuits for Matching Require Linear Depth
Ran Raz, Avi Wigderson, Hebrew University.
Lunch 12:10-1:30
Session 7 1:30-3:30
Bernard Chazelle
A Separator Theorem for Graphs with an Excluded Minor and Its Applications
Noga Alon, IBM Almaden Research Center; Paul Seymour, BellCore;
Robin Thomas, Georgia Institute of Technology.
Separators in Two and Three Dimensions
Gary L. Miller, Carnegie Mellon University and University of Southern
California; William Thurston, Princeton University.
Leighton-Rao Might be Practical: A Faster Approximation Algorithm
for Uniform Concurrent Flow
Philip Klein, Brown University;
Clifford Stein, Massachusetts Institute of Technology.
Output-sensitive Construction of Voronoi Diagrams in R↑d of Order 1 to k
Ketan Mulmuley, University of Chicago.
Solving Query-retrieval Problems by Compacting Voronoi Diagrams
Alok Aggarwal, IBM T.J. Watson Research Center and Massachusetts
Institute of Technology; Mark Hansen, Tom Leighton, MIT.
Quantitative Steinitz's Theorems with Applications to Multifingered
Grasping
David Kirkpatrick, University of British Columbia; Bud Mishra,
Chee-Keng Yap, Courant Institute.
Break 3:30-3:50
Session 8 3:50-5:10
Harold Gabow
An Optimal Algorithm for On-line Bipartite Matching
Richard M. Karp, University of California, Berkeley and International
Computer Science Institute; Umesh V. Vazirani, University of California,
Berkeley; Vijay V. Vazirani, Cornell University.
Online Algorithms for Locating Checkpoints
M. Bern, D. Greene, Xerox PARC; A. Raghunathan, Courant Institute;
M. Sudan, University of California, Berkeley.
Random Walks on Weighted Graphs, and Applications to On-Line
Algorithms
Don Coppersmith, Prabhakar Raghavan, Marc Snir, IBM T.J. Watson Research
Center; Peter Doyle, AT&T Bell Laboratories.
On the Power of Randomization in Online Algorithms
A. Borodin, University of Toronto; R. Karp, University of California,
Berkeley and International Computer Science Institute; G. Tardos,
Eotvos University; A. Wigderson, Hebrew University.
Wednesday, May 16, 1990
Session 9 8:30-10:10
Oded Goldreich
One-way Functions are Necessary and Sufficient for Secure Signatures
John Rompel, Massachusetts Institute of Technology.
Pseudo-Random Generators under Uniform Assumptions
Johan Hastad, Royal Institute of Technology, Stockholm.
The Discrete Log is Very Discreet
A.W. Schrift, A. Shamir, Weizmann Institute of Science.
Witness Indistinguishability and Witness Hiding
U. Feige, A. Shamir, Weizmann Institute of Science.
Public-key Cryptosystems Provably Secure Against Chosen Ciphertext
Attacks
Moni Naor, IBM Almaden Research Center;
Moti Yung, IBM T.J. Watson Research Center.
Break 10:10-10:30
Session 10 10:30-12:10
Ronald Fagin
On the Complexity of Local Optimality
Christos H. Papadimitriou, University of California, San Diego;
Alejandro A. Schaffer, Rice University;
Mihalis Yannakakis, AT&T Bell Laboratories.
Quantifiers and Approximation
Alessandro Panconesi, Desh Ranjan, Cornell University.
On Polynomial Bounded Truth-Table Reducibility of NP Sets to Sparse
Sets
Mitsunori Ogiwara, Osamu Watanabe, Tokyo Institute of Technology.
The Undecidability of the Semi-unification Problem
A.J. Kfoury, Boston University;
J. Tiuryn, P. Urzyczyn, University of Warsaw.
Decidability of the Multiplicity Equivalence of Multitape Finite
Automata
T. Harju, J. Karhumaki, University of Turku.
Lunch 12:10-1:30
Session 11 1:30-2:50
Oded Goldreich
Perfect Zero-knowledge in Constant Rounds
Mihir Bellare, Silvio Micali, Rafail Ostrovsky,
Massachusetts Institute of Technology.
The (True) Complexity of Statistical Zero Knowledge
Mihir Bellare, Silvio Micali, Rafail Ostrovsky,
Massachusetts Institute of Technology.
Cryptographically Secure Distributed Computation in a Constant
Number of Rounds
Donald Beaver, Harvard University;
Silvio Micali, Phillip Rogaway, Massachusetts Institute of Technology.
Efficient Computation on an Oblivious RAM
Rafail Ostrovsky, Massachusetts Institute of Technology.
Break 2:50-3:10
Session 12 3:10-4:50
Fan R. K. Chung
Computing in Quotient Groups
William M. Kantor, Eugene M. Luks, University of Oregon.
On the Decidability of Sparse Univariate Polynomial Interpolation
Allan Borodin, University of Toronto;
Prasoon Tiwari, IBM T.J. Watson Research Center.
Small Degree Primitive Roots over Finite Fields
Victor Shoup, AT&T Bell Laboratories.
On the Complexity of Computing a Grobner Basis for the Radical of a
Zero Dimensional Ideal
Y. N. Lakshman, Rensselaer Polytechnic Institute.
The Number Field Sieve
A.K. Lenstra, Bellcore; H.W. Lenstra, Jr., University of California,
Berkeley; M.S. Manasse, DEC SRC; J.M. Pollard, Tidmarsh, Reading.
∂24-Jan-90 1633 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU AFLB on Thursday
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:32:25 PST
Received: from wolvesden.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12853; Wed, 24 Jan 90 00:53:15 -0800
Received: by wolvesden.Stanford.EDU (5.61 (wolvesden 9/7/89)/inc-1.01)
id AA26052; Wed, 24 Jan 90 00:52:31 -0800
Message-Id: <9001240852.AA26052@wolvesden.Stanford.EDU>
To: aflb-all@neon.stanford.edu
Subject: AFLB on Thursday
Date: Wed, 24 Jan 90 00:52:30 PST
From: Alexander Wang <axwang@wolvesden.Stanford.EDU>
There will be an AFLB this Thursday at 12:00 in MJH 252. The speaker
will be Danny Sleator from Carnegie Mellon.
Competitive Randomized Paging Algorithms
The {\em paging problem} is that of deciding which pages to keep
in a memory of k pages in order to minimize the number of page faults.
We develop the {\em partitioning algorithm}, a randomized on-line
algorithm for the paging problem. We prove that its expected cost on
any sequence of requests is within a factor of H_k of optimum. (H_k
is the k↑{th} harmonic number, which is about ln(k).) No on-line
algorithm can perform better by this measure. Our result improves by
a factor of two the best previous algorithm.
This is joint work with Lyle McGeoch.
∂24-Jan-90 1635 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU generating random regular graphs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:30:53 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12556; Wed, 24 Jan 90 00:41:13 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02571; Wed, 24 Jan 90 00:38:14 -0800
Message-Id: <9001240838.AA02571@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5331; Wed, 24 Jan 90 02:33:31 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3588; Wed, 24 Jan 90 02:33:19 CST
Date: Tue, 23 Jan 90 22:40:35 CST
Reply-To: Brendan McKay <bdm659%csc1.anu.oz.au@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Brendan McKay <bdm659%csc1.anu.oz.au@VM1.NoDak.EDU>
Subject: generating random regular graphs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
A month or two ago, in response to a query, I posted an announcement of
a paper of Nick Wormald and I on generating random regular graphs.
(a) If anybody requested that paper from Nick but received nothing, please
ask me for it. Soon after my posting, Nick left Auckland on extended leave.
(He came here.)
(b) [the *real* reason for this posting] Has anybody who received the paper
actually programmed the algorithm? If so, and you are willing to share your
program, please let me know. Even the less efficient variants of the algorithm
would be of interest.
Thanks,
Brendan McKay. bdm@anucsd.oz or bdm659@csc1.anu.oz
∂24-Jan-90 1641 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU IMA Conference on the Unified Computation Laboratory
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:31:19 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12766; Wed, 24 Jan 90 00:48:17 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02640; Wed, 24 Jan 90 00:44:05 -0800
Message-Id: <9001240844.AA02640@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5564; Wed, 24 Jan 90 02:36:15 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4081; Wed, 24 Jan 90 02:33:50 CST
Date: Tue, 23 Jan 90 22:42:06 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Chic Rattray <cr@compsci.stirling.ac.uk>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Chic Rattray <cr%CS.STIR.AC.UK@VM1.NoDak.EDU>
Subject: IMA Conference on the Unified Computation Laboratory
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The Institute of Mathematics and Its Applications
Preliminary Notice
IMA Conference
on the
UNIFIED COMPUTATION LABORATORY
3 - 6 July 1990
University of Stirling, Scotland
CALL FOR PAPERS
The systematic study of software development has led to a wide variety
of different approaches, theories, concepts, and tools, applicable to
each stage in the specification and construction of complex software
systems, to a formal view of the development process, and to the
evolution of such systems. This diversity is often illusionary and
many approaches have a common framework and a common underlying
mathematical basis. This Conference aims to provide a forum in which
to discuss the different approaches and to consider possible unifying
frameworks for program construction theories, system structures and
the specification, design and development of future software construction
environments.
Papers are invited on: surveys, original research, practical experience
with methods, tools and environments.
Topic areas include (but are not limited to): (meta-)models of software,
software specification and construction, the development process; models
for re-usability; program construction calculi; term rewriting systems,
transformation systems; analogical and inductive reasoning systems for
software development; mathematical frameworks (logical, categorical,
.. ).
The Conference will include a number of talks by invited speakers.
There will be an opportunity for small group evening sessions on specialist
topics. Those interested should contact:
Charles Rattray
Department of Computing Science
University of Stirling
STIRLING
Scotland FK9 4LA
UK
e_mail (JANET): cr@uk.ac.stir.cs
Fax: 0786 63000 (UK)
+44 786 63000 (International)
Tele: 0786 73171 (UK)
+44 786 73171 (International)
If you wish to submit a paper, please send an extended abstract (5-7 pages)
to the above address by 28th March 1990. Notification of acceptance will be
posted to the selected authors by 30th April 1990. Conference proceedings
are to be published in the IMA Conference Proceedings Series. Full papers
must be available at the start of the Conference.
The Conference will be held in the University of Stirling, with accommodation
provided in halls of residence. The Stirling campus, one of the most
attractive in Europe, is situated on the outskirts of Stirling - the ancient
capital of Scotland - and is within easy reach of Edinburgh and Glasgow by
road and rail. Direct flights to these cities from many continental
European airports are available daily; direct flights from the USA normally
arrive at Prestwich. The alternative is to fly via London.
Further details are available from:
Miss Pamela Irving
Conference Officer
The Institute of Mathematics and Its Applications
Maitland House
Warrior Square
Southend-on-Sea
Essex SS1 2JY, UK.
tele: 0702 612177
Fax: 0702 612610
------------------------------------
UNIFIED COMPUTATION LABORATORY Conference
University of Stirling, Scotland
3 - 6 July 1990
Please send me .... copies of further information.
I shall be attending the Conference: ....(Yes) ....(No)
I intend to submit a paper(abstract) provisionally titled:
.........................................................
.........................................................
Name: ....................................................
Address: .................................................
.................................................
.................................................
.................................................
Telephone: .....................
Telex: .....................
Fax: .....................
E_mail: .....................
Return this information to:
Miss Pamela Irving, Conference Officer, The Institute of Mathematics and
Its Applications, Maitland House, Warrior Square, Southend-on-Sea,
Essex SS1 2JY, UK.
∂24-Jan-90 1640 ingrid@russell.Stanford.EDU CSLI Calendar, 25 January, vol. 5:14
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:29:34 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA21549; Wed, 24 Jan 90 15:49:06 PST
Date: Wed, 24 Jan 90 15:49:06 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001242349.AA21549@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 25 January, vol. 5:14
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
25 January 1990 Stanford Vol. 5, No. 14
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 25 JANUARY 1990
12:00 noon TINLunch
Cordura 100 The Role of Central Conceptual Structures in the
Development of Scientific and Mathematical Thought
Robbie Case
School of Education
Stanford University
(ka.rob@forsythe.stanford.edu)
Abstract in last week's Calendar
2:15 p.m.
Cordura 100 CSLI Seminar
HPSG from Afar
Paul John King
CSLI Postdoctoral Fellow
(pjking@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 1 FEBRUARY 1990
12:00 noon TINLunch
Cordura 100 Reading: A Logical Model of Machine Learning:
A Study of Vague Predicates
by Wlodek Zadrozny and Mieczyslaw Kokar
Discussion led by Jerry Hobbs
(hobbs@ai.sri.com)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Some Aspects of Word-Retrieval Errors in the
Speech of Aphasic Adults
Audrey Holland
Professor of Otolaryngology and Communication
and Associate Professor of Psychiatry
Director of the Division of Speech, Language,
and Voice Pathology, School of Medicine
University of Pittsburgh
(alh@med.pitt.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
A Logical Model of Machine Learning:
A Study of Vague Predicates
by Wlodek Zadrozny and Mieczyslaw Kokar
Discussion led by Jerry Hobbs
In this paper, we apply a logical framework to the problem of
recognizing vague predicates. We formulate a rule of abduction and
apply it in identifying objects; we formally account for the context
sensitivity of recognition observed by W. Labov. We show how multiple
theories of "cup" can be combined in a new theory of the concept.
Finally, we conjecture that operationality in explanation-based
learning is related to the cost of abduction.
The logical theory we use assumes that reasoning and learning take
place in an interaction of theories on three levels: methodological
level, object level, and referential level. An object level theory
describes the current situation; the referential level encodes
background knowledge; while the methodological level is responsible
for choosing methods of reasoning and ways of constructing models.
____________
NEXT WEEK'S CSLI SEMINAR
Some Aspects of Word-Retrieval Errors in the
Speech of Aphasic Adults
Audrey Holland
The talk will include a brief sample of a videotaped interaction with
an aphasic man who has a moderate conduction aphasia, frequent
phonemic paraphasic errors, and word-retrieval deficits. How the
patient's speech production deficits are modified as a result of the
feedback with which he is provided, how such deficits and their
resolutions are classified and coded, and some difficulties in
description of word-retrieval deficits will be the focus of the talk.
I will try to relate some of the realities of speech production
deficits to problems of building computer models of aphasia, at least
briefly.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
Approaches to the Liar Paradox, Part II
John Etchemendy
(etch@csli.stanford.edu)
Thursday, 25 January, 3:45-5:30
Cordura 100
In the logic seminar this week, John Etchemendy will talk about the
treatment of the liar paradox in Barwise and his book {\it The Liar}.
Next week, Bernie Linsky will present material from "General
Intensional Logic" by C. Anthony Anderson (chapter II.7 of the
_Handbook of Philosophical Logic_). Copies will be made available at
this week's meeting.
____________
SYMBOLIC SYSTEMS FORUM
Conversations with Apes: Reflections on the
Scientific Study of Language
John Dupre
Department of Philosophy
(dupre@csli.stanford.edu)
Thursday, 25 January, 4:15
Building 60, Room 62G
(Please note room change!)
In this talk, John Dupre will look at some of the different attempts
that have been made to teach symbolic systems, including American sign
language, to various apes. He'll also discuss the main criticisms
that have been directed against these attempts. He will argue that
these criticisms reveal serious conflicts between assumptions about
correct scientific methodology and the very possibility of the kind of
research project envisaged by the ape language researchers. Finally,
he will offer a few suggestions about why this research and its
evaluation has seemed so important to some people.
At the next Forum (1 February), Annie Zaenen will talk. Title: Verb
Varieties: Syntax or Semantics?
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Dependency Relations and Syntactic Functions:
Heads and Bases
Arnold M. Zwicky
Ohio State University and Stanford University
Friday, 26 January, 3:30
Cordura 100
A particularly simple approach to syntactic functions/relations would
treat them as located within a hierarchy (or perhaps within several
overlapping hierarchies) arising from the split between the dependency
relations HEAD-OF and DEPENDENT-OF, from the split of DEPENDENT-OF
into ARGUMENT-OF and MODIFIER-OF (and the corresponding split of
HEAD-OF into the converse relations OPERATOR-ON and MODIFIED-BY,
respectively), and from the split of ARGUMENT-OF into syntactic
functions like Subject and Direct-Object and of MODIFIER-OF into
syntactic functions like Adjectival and Adverbial.
There are well-known problems with one part of this view, involving
arguments that clearly have the syntactic functions (and sometimes the
syntactic categories as well) normally associated with modifiers: for
example, the locational dependent of the verb PUT in I PUT THE BOX ON
THE TABLE and the manner dependent of the verb WORD in WE WORDED OUR
RESPONSE CAUTIOUSLY. Phenomena like these argue for a dissociation of
the dependency relations from syntactic functions; an Adverbial is
standardly a MODIFIER-OF a nonnominal head, and the standard
non-Subject ARGUMENT-OF a verb head is a Direct-Object or an
Indirect-Object NP, but these are merely the default alignments, not
invariable associations. On the one hand, then, we have dependency
relations like ARGUMENT-OF and MODIFIER-OF, while on the other hand we
have an inventory (perhaps very large, and perhaps very complexly
organized) of syntactic functions like Subject, Adverbial, Predicator,
and so on, each with its own default associations with syntactic
categories (NP for Subject, AdvP and PP for Adverbial, V for
Predicator, and so on).
Granting dissociations that will allow (for instance) an Adverbial PP
to serve as an ARGUMENT-OF a Predicator V, we should also expect
nonstandard pairings of OPERATOR-ON and MODIFIER-OF with syntactic
functions. I propose that one of these dissociations is in fact
abundantly exemplified, when an Adverbial or Adjectival constituent C1
serves as OPERATOR-ON another constituent C2. In such a construct C0,
we would expect C1 to exhibit some of the properties of the "head"
within C0; as an OPERATOR-ON C2, C1 should be expected (following
Keenan-style generalizations) to act as agreement target with respect
to the agreement trigger C2, and as government trigger with respect to
the government target C2, and it should be expected (following the
default inheritance generalizations in most current approaches to
phrase structure) to be the locus of morphosyntactic marking for
properties belonging to C0 as a whole (unless the rule for this
construction specifically stipulates that these are marked elsewhere,
for instance on an edge of C0). But we should also expect C2 to
exhibit some of the properties of the "head" of C0; as an Adverbial or
Adjectival, C1 should be expected to be optional, and C2 should be
expected to be the "syntactic determinant," the constituent that
predicts the external distribution type of C0.
This is the split of properties that often occurs for combinations of
an auxiliary verb with its complement; for combinations of a
complementizer with a clause; for combinations of a "grammatically
used" adposition with its object NP; and for combinations of a
determiner with a nominal constituent. The syntactic literature on
these matters -- as in the _Journal of Linguistics_ exchange between
Zwicky and Hudson, or in Abney's dissertation -- is largely taken up
with attempting to argue that one or the other of the two constituents
involved *really* is the head, though there are those (Warner in
Linguistics, Fenchel in WCCFL) who propose to side-step the problem by
declaring *both* constituents to be heads. I maintain that there is
no problem, since there are two conceptually distinct entities here,
for one of which I reserve the label "head," for the other of which I
suggest the label "base."
This is not yet a theoretical proposal. Rather, I am elucidating a
distinction that I believe will have a reflex in any adequate theory
of syntax, without at the moment taking a stand on how the distinction
should be realized in a particular theory.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
Formalizing Various Intuitions About Inheritance
in Logic Programs
Fangzhen Lin
Stanford University
Monday, 29 January, 2:30
Margaret Jacks Hall 301
(Please note room change for this meeting only!)
Reasoning about inheritance is one of the earliest applications of
nonmonotonic logics. It is also one of the motivations for developing
such logics. Unfortunately, so far attempts at formalizing
inheritance hierarchies using general purpose nonmonotonic logics,
like default logic and circumscription, seem not as successful as the
ones using ad hoc methods, like the ones used by Touretzky and the
Horty trio. This raises an important question: Are these nonmonotonic
logics appropriate for the job? In this paper, we'll show that for
default and autoepistemic logics, the answer is positive.
Specifically, we'll propose a methodology for formalizing various
intuitions about inheritance in logic programs with negation as
failure (a subclass of default and autoepistemic theories). We'll
prove that one of our formalizations includes Horty's skeptical theory
as a special case. Among other things, the methodology is remarkably
simple and very similar to the ones used by McCarthy and others.
____________
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Social Aspects of Expert Systems
Bryan Pfaffenberger
Wednesday, 31 January, 12:15
Ventura 17
No abstract available.
____________
NEW CSLI POSTDOCTORAL FELLOW
Paul John King
(pjking@csli.stanford.edu)
Manchester University, England
Dates of visit: January 1990-January 1991
Graduating from London University with a mathematics degree, Paul
studied for a mathematical logic Ph.D. under Peter Aczel at Manchester
University. Drawn to him for his work on nonwellfounded sets, Aczel
soon introduced him to Barwise and Etchemendy's _The Liar_, helping
him to write a dissertation that simplified some of the maths behind
their work. Fueled by this and other dealings with situation
semantics, Aczel encouraged Paul to learn a little about linguistics.
This culminated in his Ph.D. dissertation, which dealt with the
mathematical foundations of Pollard and Sag's _Information-based
Syntax and Semantics_. Having, seemingly, developed a habit for
putting mathematical "meat" on CSLI "bones," Paul hopes to deepen this
habit while here by working alongside the situationists and/or
unification-based grammarians (whoever wants him most!) as a sort of
mathematical "janitor"!
____________
NEW CSLI VISITOR
Hiroshi Nakagawa
(nakagawa@csli.stanford.edu)
Professor of Electrical and Computer Engineering
Yokohama National University, Japan
Dates of visit: January 1990-January 1991
Hiroshi is interested in commonsense-knowledge representation and
situation theory. While at CSLI, he would like to represent
commonsense knowledge using situation theory. In trying to do this,
he also hopes to find out which parts of situation theory are useful
and/or what kinds of logical devices we should add to situation
theory. He thinks there are at least two ways in situation theory
that will allow him to do this. One is the "situation first" way,
i.e., defining operations on situations or situation types. The other
is the "infon first" way, i.e., defining operations on infons or
so-called infon algebra. Hiroshi feels he is now wandering between
these two ways.
____________
∂24-Jan-90 1652 LOGMTC-mailer Dan Yellin/ IBM
Received: from Polya.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:50:50 PST
Received: from iswim.Stanford.EDU by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26466; Wed, 24 Jan 90 11:09:39 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA01247; Wed, 24 Jan 90 10:46:55 PST
Message-Id: <9001241846.AA01247@iswim.stanford.EDU>
To: logmtc@sail.Stanford.EDU, poly@ghoti.Stanford.EDU,
daniel@mojave.stanford.edu, ag@pepper.stanford.edu,
lam@cs.stanford.edu
Subject: Dan Yellin/ IBM
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Wed, 24 Jan 90 10:46:54 PST
Sender: jcm@iswim.Stanford.EDU
Sorry for the late notice; my earlier mail bounced.
This is TODAY, not tomorrow.
------- Forwarded Message
Return-Path: jcm
To: jcm
Subject: send failed on enclosed draft
Message not delivered to anyone.
Dan Yellin from IBM will be here tomorrow (Wed) afternoon,
from 3:15-5, to talk to graduate students about possible
summer employment. If you would like to talk to him, stop
by room 352 MJH lounge during that time.
------- End of Forwarded Message
∂24-Jan-90 1658 LOGMTC-mailer Admissible sets and structures
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Jan 90 16:55:36 PST
Received: from localhost by russell.Stanford.EDU (4.0/inc-1.0)
id AA15648; Tue, 23 Jan 90 21:58:28 PST
Message-Id: <9001240558.AA15648@russell.Stanford.EDU>
To: logic@russell.Stanford.EDU, stass@russell.Stanford.EDU
Subject: Admissible sets and structures
Date: Tue, 23 Jan 90 21:58:27 PST
From: Jon Barwise <barwise@russell.Stanford.EDU>
Anybody out there happen to want a copy of my old book, Admissible
sets and structures? Springer is going to reduce the stock on it from
500 to 250 copies, so I can buy copies at 30% if I do so in the next
couple weeks. I think list price is about $52, so that would make it
$15.60, plus postage. Let me know by friday if you want one.
Please do not forward this message. In theory, I am only allowed to
purchase these books to use as complimentary copies.
∂25-Jan-90 0719 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CFGs with few nonterminals
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:19:23 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12034; Thu, 25 Jan 90 07:19:14 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10786; Thu, 25 Jan 90 07:18:50 -0800
Message-Id: <9001251518.AA10786@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9489; Thu, 25 Jan 90 08:41:23 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9467; Thu, 25 Jan 90 08:41:21 CST
Date: Thu, 25 Jan 90 08:35:26 CST
Reply-To: Brendan McKay <bdm%csc1.anu.oz.au@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Brendan McKay <bdm%csc1.anu.oz.au@VM1.NoDak.EDU>
Subject: CFGs with few nonterminals
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Let CF[k] be the set of all languages which are generated by some
context free grammar with at most k nonterminal symbols (k=1,2,...).
Is anything known about these language classes? For example,
is CF[k] a proper subset of CF[k+1] for all k?
Brendan McKay. bdm@anucsd.oz.zu or bdm@csc1.anu.oz.au
∂25-Jan-90 0720 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Info Request: Algebraic approaches to Finite Automata
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:19:57 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12042; Thu, 25 Jan 90 07:19:46 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10793; Thu, 25 Jan 90 07:19:31 -0800
Message-Id: <9001251519.AA10793@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9439; Thu, 25 Jan 90 08:40:58 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9425; Thu, 25 Jan 90 08:40:55 CST
Date: Thu, 25 Jan 90 08:35:09 CST
Reply-To: John Wickberg <wickberg%delta.eecs.nwu.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: John Wickberg <wickberg%delta.eecs.nwu.edu@VM1.NoDak.EDU>
Subject: Info Request: Algebraic approaches to Finite Automata
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am currently doing research in formal languages, specifically,
control grammars and nested push-down automatas, and I would
appreciate some references to articles on algebraic approaches
to finite automata.
I need a some background to help me decide whether or not to
buy a book I saw recently. The book title is "Finite Automata,
Their Algebras and Grammars" by J. Richard Buchi.
Please mail your replies to me, and I will post a summary in
case others are interested.
Thanks,
John Wickberg
∂25-Jan-90 0720 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU List of Research Reports from LIP-IMAG, Lyon, France
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:20:21 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12045; Thu, 25 Jan 90 07:20:00 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10796; Thu, 25 Jan 90 07:20:00 -0800
Message-Id: <9001251520.AA10796@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9546; Thu, 25 Jan 90 08:42:59 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9521; Thu, 25 Jan 90 08:41:50 CST
Date: Thu, 25 Jan 90 08:35:46 CST
Reply-To: Michel Cosnard <cosnard%ensl.ens-lyon.fr@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Michel Cosnard <cosnard%ensl.ens-lyon.fr@VM1.NoDak.EDU>
Subject: List of Research Reports from LIP-IMAG, Lyon, France
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
RESEARCH REPORTS
Laboratoire de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon
France
Enclosed is the list of the research reports of the LIP. These reports can be
+ obtained at the following address:
Laboratoire de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon
46 allee d'Italie
69364 Lyon Cedex 07
France
89-00 Rapport de presentation du LIP
Michel COSNARD
89-01 Dynamic programming on a ring of processors
Serge MIGUET et Yves ROBERT
89-02 Logiciels de simutation et de validation des algorithmes
systoliques
Abdelhamid BENAINI
89-03 A minimal time solution to the firing squad synchronization
problem with only one bit of information exchanged.
Jacques MAZOYER
89-04 Some results about On-line computation of functions
Jean DUPRAT, Yvan HERREROS et Jean-Michel MULLER
89-05 Asymptotically optimal broadcast and total-Exchange
algorithms in faulty hypercube multicomputers.
Pierre FRAIGNIAUD
89-06 Systolic triangularization over finite fields
Michel COSNARD , Jean DUPRAT et Yves ROBERT
89-07 Path planning on a ring of processors
Serge MIGUET et Yves ROBERT
89-08 A modular systolic linear array for Gaussian elimination
Abdelhamid BENAINI et Yves ROBERT
89-09 Known and new results selection, sorting and searching in
X + Y and sorted matrices.
Michel COSNARD, Jean DUPRAT et Afonso G. FERREIRA
89-10 On the behavior of simulated annealing
Bertrand BRASCHI , Afonso G. FERREIRA et Janez ZEROVNIK
89-11 Experimentations de deux algorithmes de tri sur l'hypercube
T-20 de FPS
Afonso G. FERREIRA et Michel GASTALDO
89-12 Designing parallel algorithms for linearly connected
processors and systolic arrays
Michel COSNARD
89-13 Systolic Convolution of Arithmetic Functions
Patrice QUINTON et Yves ROBERT
89-14 Synthesis of a new systolic Architecture for the Algebraic Path
Problem
Abdelhamid BENAINI, Patrice QUINTON, Yves ROBERT,
Yannick SAOUTER, Bernard TOURANCHEAU
89-15 Etiquetage des structures d'evenements du point de vue des ordres et
des graphes.
Roland ASSOUS et Christine CHARRETTON
89-16 Reseaux Connexionnistes
Helene PAUGAM-MOISY
89-17 A new algorithm for fast hardware Euclidean division
Yvan HERREROS
90-01 LAIOS - A Parallel execution of PROLOG by data copies.
Jean DUPRAT
90-02 A Study of a silico-algorithm problem : the memory occupation manager.
Jean DUPRAT
90-03 Faut-il faire confiance aux ordinateurs ?
Philippe FRANCOIS et Jean-Michel MULLER
90-04 The Cordic Algorithm : new results for fast VLSI implementation.
Jean DUPRAT et Jean-Michel MULLER
--
Michel Cosnard, tel: (33)-72-72-80-30
Laboratoire d'Informatique du Parallelisme fax: (33)-72-72-80-80
Ecole Normale Superieure de Lyon cosnard@frensl61.bitnet
69364 LYON cedex 07 - FRANCE cosnard@ensl.ens-lyon.fr
∂25-Jan-90 0720 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Grammar classes between the levels of the Chomsky hierarchy ?
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:20:36 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12053; Thu, 25 Jan 90 07:20:16 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10805; Thu, 25 Jan 90 07:20:12 -0800
Message-Id: <9001251520.AA10805@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9616; Thu, 25 Jan 90 08:44:34 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9589; Thu, 25 Jan 90 08:42:18 CST
Date: Thu, 25 Jan 90 08:36:03 CST
Reply-To: Hans Huttel <hans%lfcs.ed.ac.uk@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Hans Huttel <hans%lfcs.ed.ac.uk@VM1.NoDak.EDU>
Subject: Grammar classes between the levels of the Chomsky hierarchy ?
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Can anyone provide me with information on and pointers to literature
on `natural' classes of grammars lying between the levels of the
Chomsky hierarchy ? By `natural' I mean classes of grammars that do
not pose too artificial restrictions on the production rules.
I am particularly interested in stuff on classes of CF grammars that
define a proper subclass of the CF languages including the regular
languages. I am also interested in similar work done for the
infinitary case; it is well-known that the Greibach algebraic
infinity-languages form a proper subclass of the infinity-regular
languages (in contrast to the finitary case). There must be something
stronger than infinity-regular but weaker than infinity-CF (???).
Please reply by e-mail; if there is any interest I will post a summary.
Regards
Hans
| Hans H\"{u}ttel, Office 1603 JANET: hans@uk.ac.ed.lfcs
| LFCS, Dept. of Computer Science UUCP: ..!mcvax!ukc!lfcs!hans
| University of Edinburgh ARPA: hans%lfcs.ed.ac.uk@nsfnet-relay.ac.uk
| Edinburgh EH9 3JZ, SCOTLAND ... Ain't gonna work on Maggie's farm no more!
∂25-Jan-90 0721 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ISCIS5 CALL FOR PAPER
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:21:20 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12062; Thu, 25 Jan 90 07:20:43 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10810; Thu, 25 Jan 90 07:20:28 -0800
Message-Id: <9001251520.AA10810@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0254; Thu, 25 Jan 90 08:47:30 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0232; Thu, 25 Jan 90 08:44:07 CST
Date: Thu, 25 Jan 90 08:39:38 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"Prof.Dr.Emre Harmanci" <HARMANCI@TRITU.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "Prof.Dr.Emre Harmanci" <HARMANCI%TRITU.BITNET@VM1.NoDak.EDU>
Subject: ISCIS5 CALL FOR PAPER
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The Fifth International Symposium on
Computer and Information Sciences
ISCIS 5
Cappadocia, Turkey
October 30 to November 2, 1990
Organized by
Istanbul Technical University (ITU)
With the support of the Computer Engineering Depatments of the following
Universities: Bogazici Univ.(Istanbul), Bilkent Univ.(Ankara), Ege Univ.
(Izmir), Middle East Technical Univ.(Ankara) and of the Electronics
Research Center of TUBITAK at METU (Ankara).
Areas covered by the conference include: Computer Architecture and Systems,
Performance Analysis and Evaluation, Theoretical Computer Science,
Programming Systems, Database Systems, Networks, Parallelism and
Distributed Systems, Artificial Intelligence and Neural Networks,
Computational Mathematics.
Full papers, limited to 10 pages, should be submitted in 3 copies, by June 1
1990 to:
Prof.A.E.HARMANCI,Program Chairman
I.T.U. Bilgi Islem Merkezi
Ayaza}a 80626 ISTANBUL/TURKEY
E-mail : HARMANCI@TRITU.BITNET
Fax : (+90.1) 1761734
Telex : 286186-ITU TR
Organizing Committee : E.Gelenbe (Chairman), M.Arkun, B.Epir, A.E.Harmanci,
H.Guran, A.R.Kaylan, O.Manas, N.Yucel
Program Committee : A.E.Harmanci (Chairman), M.C.Calzarossa (I), A.Dogac (TR),
J.M.Fourneau (F), E.Gelenbe (F), S.Jaehnischen (D), A.R.Kaylan (TR),
M.Raynal (F), E.Orhun (TR), B.Ozguc (TR), K.Oflazer (TR), E.Paseron (I),
K.Pekmetzi (GR), J.F.Perrot (F), G.Serazzi (I), A.Stafylopatis (GR),
N.Yalabik (TR)
Proceedings : The proceedings of the ISCIS 5 will be published by an
International Publisher. The ISCIS 2,3 and 4 proceedings have been published
by Nova Science Press (USA).
Venue : The Conference will be held in an international hotel in the beautiful
historical and archeological CAPPADOCIA region of Turkey, famous for its
troglodyte dwellings and churches, and easily accessible from Ankara.
∂25-Jan-90 0721 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Cube-Connected Cycles
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:21:34 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12075; Thu, 25 Jan 90 07:20:52 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10823; Thu, 25 Jan 90 07:20:54 -0800
Message-Id: <9001251520.AA10823@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0293; Thu, 25 Jan 90 08:48:34 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0279; Thu, 25 Jan 90 08:44:35 CST
Date: Thu, 25 Jan 90 08:39:55 CST
Reply-To: Rolf Wanka <wanka%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Rolf Wanka <wanka%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Subject: Cube-Connected Cycles
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Hi,
does someone know a reference, where I can find the
proof that the Cube-Connected Cycles network
by Preparata & Vuillemin has an Hamiltonian cycle ?
Because there are some problems with our local
news-server, please answer me by e-mail.
Thanks in advance
Rolf Wanka
---------------------------------------------------------------------------
UUCP: wanka@pbinfo.UUCP | Rolf Wanka
or wanka@pbinfo.uni-paderborn.de | Universitaet-GH Paderborn
or ...!uunet!unido!pbinfo!wanka | Fachbereich 17-Mathematik/Informatik
CSNET: wanka%pbinfo.uucp@Germany.CSNET | Warburger Str. 100
ARPA: wanka@pbinfo.uni-paderborn.de | D-4790 Paderborn, West Germany
---------------------------------------------------------------------------
∂25-Jan-90 0722 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Randomness vs complexity of a sequence
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 07:21:55 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12087; Thu, 25 Jan 90 07:21:38 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10826; Thu, 25 Jan 90 07:21:04 -0800
Message-Id: <9001251521.AA10826@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0331; Thu, 25 Jan 90 08:49:10 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0314; Thu, 25 Jan 90 08:45:02 CST
Date: Thu, 25 Jan 90 08:40:05 CST
Reply-To: Kihong Park <park%cs.scarolina.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Kihong Park <park%cs.scarolina.edu@VM1.NoDak.EDU>
Subject: Randomness vs complexity of a sequence
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
There was a posting by Andrew Palfreyman inquiring about the definition of
randomness of individual sequences in sci.stat. His proposition was that one
could use a "window" of variable length which is moved over a finite string
and observe the contiguous patterns under the window if the size of the
window is varied. Then, one could compare the expected frequency with the
observed frequency, and if their difference over various lengths of the
window is small, one may conclude that the string at hand is more or less
random. It is my understanding that such a schema is called "block-testing".
So much for introduction. Below is the comment that I posted on sci.stat.
I have proposed a definition of randomness which tries to make a
distinction between the randomness of a sequence vs the complexity of a
sequence. I would greatly appreciate any comments regarding my definition,
and if there has been prior work on the very subject, I would appreciate if
someone could inform me of that. Here is the posting:
I think it is useful that Andrew Palfreyman posted this question of randomness
of individual sequences. Actually, the "sliding window" which Andrew mentioned
has to be generalized so that not only the length but also the individual
cells of the window are allowed to be active or dormant. Using this schema,
one is calculating all possible n'th order statistics where n = 1,2,...,length
of string-1.
Assuming the individual sequence sites were generated independently by some
random process, for each positional k'th order statistic calculated, one
can compare this number with the analytically computable expected number.
Summing up the differences of the calculated and expected numbers for all
possible k'th order statistics with positional variation, one yields a measure
of how patternless a particular sequence is.
Based on this, I have made the following definition:
A finite sequence over {0,1} is random w.r.t. a function f: {0,1} -> real
numbers, if and only if for the measure described above(call is d), d is the
greatest
lower bound of all possible f's. That is, d(f) = inf { d(f) : f belongs to the
above familiy of functions.
Note that d is a function of a particular instance of the above described
family of functions, and actually the range of f is the set of non-negative
reals where f satisfies all the conditions of a p.d.f. That is, f(x) is non-
negative for all x in the domain, and the summation of f(x) over all x is 1.
I have a formal definition of the measure d, and also the defintion can be
extended to apply to sequences over any finite alphabet.
Indeed, I have generalized this notion to one-way infinite sequences.
Why this definition? I think the randomness of a sequence should be
distinguished from the complexity of a sequence. The complexity of a sequence
is described
by what is called Kolmogorov complexity or algorithmic information content of
an individual sequence. Chaitin, Solomonoff, and Kolmogorov have defined a
measure to describe the information content of an individual sequence. For
references, see G. Chaitin "Algorithmic information theory" IBM Journal of
Research and Development 21, pp 350-359. People(including Chaitin) put forward
statements such as "a sequence generated by a coin with probabilities 1/2,1/2
is more random than one generated with 3/4, 1/4". I would like to say that the
former is more complex than the latter sequence, but both are equally random.
Here, by randomness, I mean the property that one who does not have any
information about the sequence except for its past behavior, cannot make better
predictions about its future except for guessing with accuray 1/2,1/2 or
3/4,1/4 whichever the case may be. Hence, I am claiming that in terms of the
independence of events in such two different coin-tossing scenarios, both
cases are independent events, and thus the outcome of patterns random. Their
complexity is different as concluded from algorithmic information theory.
I am studying the bahavior of one-way infinite sequences, and I would appreciate
any comments regarding the (informal) definitions I have given; and also
I would be greatful if somebody knows of prior work pertaining to what I
have presented.
Kihong Park.(park@cs.scarolina.edu on the CS.NET).
∂25-Jan-90 0944 LOGMTC-mailer Admissible sets and structures
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 09:44:47 PST
Received: from csli.Stanford.EDU by russell.Stanford.EDU (4.0/inc-1.0)
id AA25644; Thu, 25 Jan 90 09:47:20 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA24551; Thu, 25 Jan 90 09:46:11 PST
Date: Thu, 25 Jan 90 09:46:11 PST
From: nakagawa@csli.Stanford.EDU (Hiroshi Nakagawa)
Message-Id: <9001251746.AA24551@csli.Stanford.EDU>
To: barwise@russell.stanford.edu
Cc: logic@russell.stanford.edu, stass@russell.stanford.edu
In-Reply-To: Jon Barwise's message of Tue, 23 Jan 90 21:58:27 PST <9001240558.AA15648@russell.Stanford.EDU>
Subject: Admissible sets and structures
Hello
I would like to buy a reduced priced copy of your book, Admissible
sets and structures.
nakagawa@csli
(Hiroshi Nakagawa, new visiting scholar, Jan. 1990 -Jan. 1991)
∂25-Jan-90 1357 carlstea@sierra.STANFORD.EDU Informal seminar - today
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 13:57:12 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Thu, 25 Jan 90 13:54:25 PST
Date: Thu, 25 Jan 90 13:54:25 PST
From: carlstea@sierra.STANFORD.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.STANFORD.EDU
Subject: Informal seminar - today
Message-Id: <CMM.0.88.633304463.carlstea@>
There will be an informal seminar given today by:
Mr. Hidenori Kawanishi
Sharp, Ltd., Nara, Japan
regading Sharp's work on the AlGaAs surface stabilization by
sulfide treatment, which leads to the improvement of AlGaAs
laser characteristics.
McCullough 240, Thursday Jan. 25th, 2:30 p.m.
∂25-Jan-90 1423 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Strong Fairness Paper
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Jan 90 14:22:55 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04556; Thu, 25 Jan 90 14:22:35 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16177; Thu, 25 Jan 90 14:21:24 -0800
Message-Id: <9001252221.AA16177@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4410; Thu, 25 Jan 90 16:19:14 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4386; Thu, 25 Jan 90 16:19:11 CST
Date: Thu, 25 Jan 90 16:18:34 CST
Reply-To: Michael Main <main%boulder.Colorado.EDU@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Michael Main <main%boulder.Colorado.EDU@VM1.NoDak.EDU>
Subject: Strong Fairness Paper
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The following paper is now available by email (troff format) or
I can send you a hard copy. Please send requests to
main@boulder.colorado.edu, and specify whether you would
prefer an electronic or hard copy. -- Michael Main
COMPLETE PROOF RULES FOR
STRONG FAIRNESS AND STRONG EXTREME-FAIRNESS
Michael Main
Department of Computer Science
University of Colorado
Boulder, CO 80309 USA
main@boulder.colorado.edu
(303) 492-7579
This paper demonstrates completeness of a termination-rule for iterative
programs with strongly fair nondeterminism, even when there are countably
infinite options for the nondeterminism. This means that whenever a program is
guaranteed to terminate under the assumption of strong fairness, then this
termination can be proved via the strongly fair termination rule. A variant of
the rule is also shown to be complete for extremely-fair nondeterminism, as
introduced by Pnueli and developed by Francez [``Fairness'' Section 4.3].
These completeness results are not immediately obvious from the completeness
of the rule for finitely many options, because of the recursive form of the
rule.
∂26-Jan-90 1418 helen@russell.Stanford.EDU CSLI-SSP Summer Internships
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Jan 90 14:18:41 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA08026; Fri, 26 Jan 90 14:21:02 PST
Date: Fri 26 Jan 90 14:21:01-PST
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: CSLI-SSP Summer Internships
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <633392461.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
TO: SSP FACULTY
SUBJECT: CSLI-SSP SUMMER INTERNSHIPS
We're delighted to announce our CSLI-SSP Summer Internships for 1990.
These internships are open to SSP majors and SSP faculty sponsors.
Like last year, CSLI will cover half the cost of the internships, with
matching funds coming from individual faculty sponsors. To form a
preliminary list of internship possibilities we'd appreciate it if
you would answer the questions below.
1. Do you have plans for a summer project that could include an
intern? Describe the project in a few phrases. (We'd like to hear,
even if the plans are very tentative.)
2. What sort of work would the intern do? What
qualifications/coursework would you prefer?
3. Do you have a source of matching funds? (Definitely not,
possibly, probably, yes)
About the Internships: Under the guidance of a faculty sponsor,
interns work full time for 10 weeks (July 2 - Sept 7) assisting on
research projects. This year's cost for a single intern, including
the salary of $10.75/ hour and 25.6% benefits surcharge, is $5,486.
Thus, faculty sponsors would contribute $2,743.
We encourage a diversity of internship possibilities ranging from
programming to theory/foundational work to empirical research.
I plan to send the general announcement early next week, hoping that
I'll have a preliminary list of projects to show to students compiled
from your responses. If you have any questions, please call me
(723-4091, 725-2326) or send email.
Thanks,
Helen
-------
∂26-Jan-90 1451 keyes@sierra.STANFORD.EDU FACULTY MEETING
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 26 Jan 90 14:51:21 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Fri, 26 Jan 90 14:47:52 PST
Date: Fri, 26 Jan 90 14:47:52 PST
From: keyes@sierra.STANFORD.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.STANFORD.EDU
Subject: FACULTY MEETING
Message-Id: <CMM.0.88.633394072.keyes@>
A FACULTY MEETING to discuss the results of the Quals will be held on
Friday, February 2, at 3:15 PM in McCullough 134.
J. W. Goodman
∂27-Jan-90 1946 grundy@csli.Stanford.EDU The Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Jan 90 19:45:57 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA10398; Sat, 27 Jan 90 19:44:27 PST
Date: Sat 27 Jan 90 19:44:26-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: The Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <633498266.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, February 1, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Annie Zaenen
Topic: "Verb Varieties: Syntax or Semantics?"
ABSTRACT
--------
Traditional grammars and dictionaries generally
subdivide verbs into transitive and intransitive ones. It
is, however, well known that finer classifications are
needed in linguistic description. In this talk I'll discuss
the differences between two classes of intransitive verbs in
Dutch and Italian and show how their syntactic differences
correlate with subtle differences in meaning.
A discussion of the differences between Italian and
Dutch will raise the problem of how word meaning corresponds
with what is 'out in the real world'.
-------
∂28-Jan-90 1249 hemenway@Sunburn.Stanford.EDU Meeting Reminder
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Jan 90 12:49:42 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10218; Sun, 28 Jan 90 12:50:37 -0800
Date: Sun, 28 Jan 1990 12:50:36 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Meeting Reminder
Message-Id: <CMM.0.88.633559836.hemenway@Sunburn.Stanford.EDU>
This is a reminder of the meeting of the PhD Admissions committee,
this Tuesday, Jan. 30 at 2:30 pm in MJH 252.
Hope to see you all there--
Sharon
∂28-Jan-90 1310 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU McCluskey Honor
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Jan 90 13:10:30 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10331; Sun, 28 Jan 90 13:10:50 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA04830; Sun, 28 Jan 90 13:04:51 PST
Date: Sun, 28 Jan 90 13:04:51 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9001282104.AA04830@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: McCluskey Honor
Ed McCluskey (along with some others) will be receiving the ACM SIGCSE
Award for outstanding contributions to computer science education
(Curriculum '68) at the 21st ACM SIGCSE Technical Symposium in
Washington DC on February 22-23, 1990. Congratulations, Ed!
∂28-Jan-90 2036 snoeyink@Neon.Stanford.EDU BATS at berkeley, feb 16
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Jan 90 20:35:55 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA08158; Sun, 28 Jan 90 20:31:33 -0800
Date: Sun, 28 Jan 90 20:31:33 -0800
From: Jack Snoeyink <snoeyink@Neon.Stanford.EDU>
Message-Id: <9001290431.AA08158@Neon.Stanford.EDU>
To: aflb-su@Neon.Stanford.EDU, students@Neon.Stanford.EDU
Subject: BATS at berkeley, feb 16
Advance warning: BATS (the Bay Area Theory Seminar) will be at
Berkeley on friday, feb 16. (Computer forum ends the 15th and we'd
hate it if you didn't have a talk you could go to!)
If anyone would like to speak, please let me know and I'll tell Sandy
Irani. I'll be sending out abstracts when they are available and
coordinating rides.
(Anyone who is NOT on the aflb (algorithms for lunch bunch) mailing
list and would like to hear about the talks, should send me mail---I
will use that mailing list in the future.)
o Jack
_/\_.
(')>-(`) snoeyink@cs.stanford.edu
∂29-Jan-90 0723 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Hamiltonian cycles in 4-connected planar graphs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 07:22:36 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05855; Mon, 29 Jan 90 07:22:38 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03506; Mon, 29 Jan 90 07:19:28 -0800
Message-Id: <9001291519.AA03506@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7711; Mon, 29 Jan 90 09:17:06 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7694; Mon, 29 Jan 90 09:17:04 CST
Date: Mon, 29 Jan 90 09:14:27 CST
Reply-To: Samir Khuller <khuller%cu-arpa.cs.cornell.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Samir Khuller <khuller%cu-arpa.cs.cornell.edu@VM1.NoDak.EDU>
Subject: Hamiltonian cycles in 4-connected planar graphs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Recently, someone posted a query asking for a reference to a result
by 2 japanese authors (i think they were Nishizeki and Chiba). The
algorithm is given in their book on Planar Graphs: Theory and Algorithms,
Annals of discrete mathematics (32), North Holland Mathematical Studies.
by Nishizeki and Chiba. A reference to the paper is probably also
provided there (i think it is due to appear in Journal of ALgorithms).
∂29-Jan-90 0723 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU P = NP? (The Dilemma is Re-Solved)
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 07:23:03 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05862; Mon, 29 Jan 90 07:23:09 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03524; Mon, 29 Jan 90 07:22:52 -0800
Message-Id: <9001291522.AA03524@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7795; Mon, 29 Jan 90 09:18:48 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7781; Mon, 29 Jan 90 09:17:58 CST
Date: Mon, 29 Jan 90 09:14:52 CST
Reply-To: "C.P. Ravikumar" <rkumar%buddha.usc.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "C.P. Ravikumar" <rkumar%buddha.usc.edu@VM1.NoDak.EDU>
Subject: P = NP? (The Dilemma is Re-Solved)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
P=NP? A Dilemma Is ReSolved
---------------------
``Provably P = NP!'' The headline quotes
That a bright young professor so said.
Although this means my research is dead,
There is some bright news to be spread:
Traveling salesmen may now travel in peace
Optimal tours are easily found!
We'll pack their luggage in minimal bins!
Yes, yes, we will meet the lower bound!
But Alas! Next day the editor apologized
In fonts which was rather small sized,
That there was a printing mistake yesterday,
``Probably'' is what Prof. meant to say.
That leaves us where we were before,
Knocking again at the mystery's door!
...........................................................
C.P. Ravikumar
∂29-Jan-90 0723 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Parallel Computation Day at NYU
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 07:23:33 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05866; Mon, 29 Jan 90 07:23:30 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03527; Mon, 29 Jan 90 07:23:26 -0800
Message-Id: <9001291523.AA03527@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8062; Mon, 29 Jan 90 09:21:22 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8042; Mon, 29 Jan 90 09:21:15 CST
Date: Mon, 29 Jan 90 09:20:36 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Richard Cole <cole@csd29.nyu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Richard Cole <cole%csd29.nyu.edu@VM1.NoDak.EDU>
Subject: Parallel Computation Day at NYU
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Courant Institute of Mathematical Sciences
New York University
PARALLEL COMPUTATION DAY
Friday, February 23, 1990
Room 109, Warren Weaver Hall
251 Mercer Street, New York, NY 10012-1185
PROGRAM
10:00-11:00 Randomized Routing and Sorting
on Fixed Connection Networks
Abhiram Ranade, UC Berkeley
11:00-12:00 A Constant Time Message Routing System
Using Holographic Matching
John Reif, Duke University
2:00-3:00 Models for the Design and Analysis
of Parallel Algorithms
Marc Snir, IBM Yorktown Heights
3:00-4:00 Instruction-Level Parallelism and VLIWs
Josh Fisher, Multiflow Computers
4:00-5:00 Reception (13th floor lounge)
For more information contact: Richard Cole
(212-998-3119, cole@cs.nyu.edu)
The workshop is sponsored, in part, by the National
Science Foundation and the Defense Advanced Research
Projects Agency via a joint grant to New York University
and the University of Maryland.
∂29-Jan-90 0727 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU A Reccurrence Relation
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 07:26:59 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06039; Mon, 29 Jan 90 07:27:02 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03651; Mon, 29 Jan 90 07:26:32 -0800
Message-Id: <9001291526.AA03651@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8133; Mon, 29 Jan 90 09:23:48 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8115; Mon, 29 Jan 90 09:21:42 CST
Date: Mon, 29 Jan 90 09:20:50 CST
Reply-To: Srinivas Kankanahalli <opus!srini%lanl.gov@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Srinivas Kankanahalli <opus!srini%lanl.gov@VM1.NoDak.EDU>
Subject: A Reccurrence Relation
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Can somebody tell me if there is a way to find a closed form solution to
the reccurrence relation below.
E(k)= 1+ sum from j=2 to k-1 (k ) R↑(j-1) (1-R)↑(k-j+1) E(j)
(j-1 )
-----------------------------------------------------------
1-k R↑(k-1) + (k-1) R↑k
(k )
(j-1) is k choose j-1.
We have a log approximation for k >=3. Any approximations will also be
useful.
-Srinivas K
Computing Research Lab
New Mexico State University
Tel:(505)-646-4535 (Off).
∂29-Jan-90 0743 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU IEEE Symposium on Logic in Computer Science
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 07:43:16 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06196; Mon, 29 Jan 90 07:43:08 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03760; Mon, 29 Jan 90 07:41:11 -0800
Message-Id: <9001291541.AA03760@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9488; Mon, 29 Jan 90 09:40:00 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9425; Mon, 29 Jan 90 09:39:55 CST
Date: Mon, 29 Jan 90 09:38:36 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"John C. Mitchell" <jcm@cs.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "John C. Mitchell" <jcm%cs.Stanford.EDU@VM1.NoDak.EDU>
Subject: IEEE Symposium on Logic in Computer Science
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Preliminary program announcement
IEEE Symposium on Logic in Computer Science
June 4-7, Philadelphia, PA
Banquet Speaker: R.O. Gandy, Oxford
Special session on automated decuction (to be announced).
Technical papers grouped into prospective sessions
(order not yet determined):
NEW FOUNDATIONS FOR FIXPOINT COMPUTATIONS
Roy L. Crole and Andrew M. Pitts
POLYMORPHISM, SET THEORY, AND CALL-BY-VALUE
Edmund Robinson and Giuseppe Rosolini
UNIVERSAL DOMAINS IN THE THEORY OF DENOTATIONAL
SEMANTICS OF PROGRAMMING LANGUAGES
M. Droste and R. Gobel
THE CLASSIFICATION OF CONTINUOUS DOMAINS
Achim Jung
COMPLETENESS FOR TYPED LAZY EQUALITIES
Jon Riecke, Stavros Cosmadakis and Albert Meyer
TYPE RECONSTRUCTION IN FINITE-RANK FRAGMENTS OF
THE POLYMORPHIC $\lambda$-CALCULUS
A.J. Kfoury and J. Tiuryn
CONDITIONAL LAMBDA-THEORIES AND THE VERIFICATION
OF STATIC PROPERTIES OF PROGRAMS
Mitchell Wand
SINGLE-THREADED POLYMORPHIC LAMBDA CALCULUS
Juan C. Guzman and Paul Hudak
PROGRAMMING IN EQUATIONAL LOGIC: BEYOND STRONG SEQUENTIALITY
I.V. Ramakrishnan
THE THEORY OF GROUND REWRITE SYSTEMS IS DECIDABLE
Max Dauchet and S. Tison
WELL REWRITE ORDERINGS
Pierre Lescanne
A CONSTRUCTIVE PROOF OF HIGMAN'S LEMMA
James R. Russell and Chet Murthy
SYNTACTIC THEORIES AND UNIFICATION
Claude Kirchner and Francis Klay
PROOF TRANSFORMATIONS FOR EQUATIONAL THEORIES
Tobias Nipkow
A NEW AC UNIFICATION ALGORITHM WITH A NEW ALGORITHM FOR
SOLVING DIOPHANTINE EQUATIONS
Alexandre Boudet, Evelyne Constejean and Herve Devie
ON SUBSUMPTION AND SEMIUNIFICATION IN FEATURE ALGEBRAS
William Rounds
SYMBOLIC MODEL CHECKING: $10↑20$ STATES AND BEYOND
David Dill, J. Hwang, J.R. Burch, E.M. Clarke
and K.L. McMillan
WHEN IS "PARTIAL" ADEQUATE? A LOGIC-BASED PROOF TECHNIQUE
USING PARTIAL SPECIFICATIONS
Bernhard Steffen and Rance Cleaveland
MODELLING SHARED STATE IN A SHARED ACTION MODEL
Kenneth J. Goldman and Nancy A. Lynch
ON THE LIMITS OF EFFICIENT TEMPORAL DECIDABILITY
E. Allen Emerson, Mike Evangelist and Jai Srinivasan
EQUATION SOLVING THROUGH AN OPERATIONAL SEMANTICS OF CONTEXT
Kim G. Larsen and Liu Xinxin
THREE LOGICS FOR BRANCHING BISIMULATION
Rocco De Nicola and Frits Vaandrager
REACTIVE, GENERATIVE, AND STRATIFIED MODELS OF PROBABILISTIC PROCESSES
R. van Glabbeek, Scott A. Smolka, B. Steffen and Chris Tofts
THE NONEXISTENCE OF FINITE AXIOMATISATIONS FOR CCS CONGRUENCES
Faron Moller
A LOGIC OF CONCRETE TIME INTERVALS
Harry R. Lewis
REAL-TIME LOGICS: COMPLEXITY AND EXPRESSIVENESS
Rajeev S. Alur and Tom Henzinger
EXPLICIT CLOCK TEMPORAL LOGIC
Amir Pnueli, Harel, Lichtenstein
MODEL-CHECKING FOR REAL-TIME SYSTEMS
Rajeev Alur, Costas Courcoubetis and David Dill
A DECISION PROCEDURE FOR A CLASS OF SET CONSTRAINTS
Joxan Jaffar and Nevin Heintze
A CONSTRAINT SEQUENT CALCULUS
Jean-Louis Lassez and Ken McAloon
SOLVING INEQUATIONS IN TERM ALGEBRAS
H. Comon
THE DYNAMIC LOGIC OF PERMISSION
R. van der Meyden
A THEORY OF NON-MONOTONIC RULE SYSEMS
Wiktor Marek and Anil Nerode
THE SEMANTICS OF REFLECTED PROOF
Robert L. Constable
ON THE POWER OF BOUNDED CONCURRENCY: REASONING ABOUT PROGRAMS
David Harel, Roni Rosner and Moshe Vardi
NORMAL PROCESS REPRESENTATIVES
Vijay Gehlot and Carl Gunter
A CATEGORIAL LINEAR FRAMEWORK FOR PETRI NETS
Carolyn Brown and Doug Gurr
A LINEAR SEMANTICS FOR ALLOWED LOGIC PROGRAMS
S. Cerrito
0-1 LAWS FOR INFINITARY LOGICS
Phokion Kolaitis and Moshe Vardi
IMPLICIT DEFINABILITY ON FINITE STRUCTURES AND UNAMBIGUOUS COMPUTATIONS
Phokion Kolaitis
ALOGTIME AND A CONJECTURE OF S.A. Cook
Peter Clote
ON THE EXPRESSION OF MONADIC SECOND-ORDER GRAPH PROPERTIES
WITHOUT QUANTIFICATIONS OVER SETS OF EDGES
Bruno Courcelle
EXTENSIONAL PERS
Peter Freyd, P.Mulry, G.Rosolini, D.Scott
RECURSIVE TYPES REDUCED TO INDUCTIVE TYPES
Peter Freyd
A PER MODEL OF POLYMORPHISM AND RECURSIVE TYPES
M. Abadi and G. D. Plotkin
EFFECTIVE DOMAINS AND INTRINSIC STRUCTURE
Wesley Phoa
General chair: Albert R. Meyer
Conference chair: Jean Gallier
Program Chair: John C. Mitchell
Program committee: K. Apt, J. Barwise, E. Clarke, S. Cook, S. Hayashi,
P. Kanellakis, J.-P. Jouannaud, D. Leivant, J. Mitchell, U. Montanari,
A. Pitts, E. Sandewall, A. Scedrov, M. Stickel, G. Winskel
For further conference information, send electronic mail
to lics@cs.cmu.edu.
∂29-Jan-90 0800 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Education Search
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 07:59:59 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15485; Mon, 29 Jan 90 08:00:25 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA05116; Mon, 29 Jan 90 07:54:26 PST
Date: Mon, 29 Jan 90 07:54:26 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9001291554.AA05116@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Education Search
The search for an assistant chair for educational affairs, a Professor
(Teaching) continues. We are interviewing Eric Roberts, Peter
Henderson, and Stuart Reges. We didn't have many faculty members come
to hear Eric last week talk about his views on undergraduate c.s.
education. Today we are interviewing Peter Henderson from SUNY
Stonybrook. At 4:30 p.m. today, Peter will be making an informal
presentation about his approach to c.s. education in mjh 252. This
is an important choice for the Department, and I hope we will have
some informed faculty members when we all finally meet to decide which
of these candidates will be one of our professorial colleagues. If
anybody would like to meet Peter at some other time today, or
accompany a group taking him to dinner, please get in touch with
George Wheaton. Thanks, -Nils
∂29-Jan-90 0926 eisensee@sierra.STANFORD.EDU Solid State Lab Seminar
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 09:26:51 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Mon, 29 Jan 90 09:20:38 PST
Date: Mon, 29 Jan 90 09:20:38 PST
From: eisensee@sierra.STANFORD.EDU (Sandra K. Eisensee)
To: ee-adminlist@sierra, ee-faculty@sierra, Iclabusers@glacier
Cc: eisensee@sierra.STANFORD.EDU
Subject: Solid State Lab Seminar
Message-Id: <CMM.0.88.633633635.eisensee@>
SOLID STATE LAB SEMINAR
AKA EE 430
TIME: 4:00pm REFRESHMENTS
4:15pm TALK STARTS
PLACE: AEL 109
DATE: JANUARY 31, 1990
Ray Browning
Center for Integrated Systems, Stanford
"MAGNETIC IMAGING WITH A NOVEL SEM (SEMPA)"
A novel SEM has been developed to give high spatial resolution images of
magnetic structures. The microscope uses the spin polarization of the
secondary electrons to measure the direction of the surface magnetization
(Hence, SEM with spin polarization analysis, SEMPA). The technique can be
used to image a wide range of samples. For examples, the bit patterns on a
magnetic recording hard disc, the closure domain structure of an Fe crystal,
and the complex domain wall structures at the surface of an Fe-4%Si crystal.
With the new instrument, we are developing several new techniques, one of
which uses a thin (2nm) film of Fe to enhance the spin polarized signal. This
has been used to enhance the contrast on magnetic recording media, and thus
greatly improve the measurement of the low contrast bit patterns.
∂29-Jan-90 1048 ingrid@russell.Stanford.EDU Seminar on Computers, Design, and Work - Wed, 31 Jan, 12:15
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 10:48:22 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA22468; Mon, 29 Jan 90 10:10:20 PST
Date: Mon, 29 Jan 90 10:10:20 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001291810.AA22468@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Seminar on Computers, Design, and Work - Wed, 31 Jan, 12:15
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Embedded Values, Moral Delegates, and Expert Systems:
Toward a Political Anthropology of Computing Technology
Bryan Pfaffenberger
Wednesday, 31 January, 12:15
Ventura 17
Many technical systems incorporate what Bruno Latour calls a delegate:
a technical feature that is intended to force people to conform to
moral norms. Such systems are not merely instrumental. They are also
systems of moral authority, and comprehending their social impact
requires more than a political sociology; it requires a political
anthropology, which is capable of comprehending the social impact and
meaning of an imposed system of moral and judicial authority. This
point is illustrated through an examination of the debate concerning a
recent attempt to capture the rules of the British Nationality Act
(1981) in an expert system.
Bio
Assistant Professor of Humanities, School of Engineering and Applied
Science, University of Virginia. Ph.D.: social and cultural
anthropology, University of California, Berkeley. Current interests:
social history of personal computing, social construction and social
impact of expert system technology, technology transfer to Third World.
**********************************************************************
To the degree that he masters his tools, he can invest the world with
his meaning; to the degree that he is mastered by his tools, the shape
of the tool determines his own self-image. --- Ivan Illich
**********************************************************************
Bryan Pfaffenberger XB.p07@STANFORD
**********************************************************************
∂29-Jan-90 1154 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SUMMARY - Between the levels of the Chomsky hierarchy
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 11:53:57 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21562; Mon, 29 Jan 90 11:53:07 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07401; Mon, 29 Jan 90 11:49:08 -0800
Message-Id: <9001291949.AA07401@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8586; Mon, 29 Jan 90 13:43:19 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8570; Mon, 29 Jan 90 13:43:14 CST
Date: Mon, 29 Jan 90 13:42:31 CST
Reply-To: Hans Huttel <mcsun!ukc!edcastle!lfcs!hans%uunet.uu.net@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Hans Huttel <mcsun!ukc!edcastle!lfcs!hans%uunet.uu.net@VM1.NoDak.EDU>
Subject: SUMMARY - Between the levels of the Chomsky hierarchy
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Some time (24 Jan 90 15:16:45 GMT) I posted an article
(<1801@castle.ed.ac.uk>) to comp.theory, sci.lang, and sci.math. It went
as follows:
-------------------------------------------------------------------------------
Can anyone provide me with information on and pointers to literature
on `natural' classes of grammars lying between the levels of the
Chomsky hierarchy ? By `natural' I mean classes of grammars that do
not pose too artificial restrictions on the production rules.
I am particularly interested in stuff on classes of CF grammars that
define a proper subclass of the CF languages including the regular
languages.
[ The next was slightly flawed because a line fell out. Here's what I
MEANT to write: ]
I am also interested in similar work done for the infinitary case; it
is well-known that the Greibach algebraic infinity-languages form a
proper subclass of the algebraic infinity-languags but not of the
infinity-regular languages (in contrast to the finitary case). There
must be something stronger than infinity-regular but weaker than
infinity-CF (???).
Please reply by e-mail; if there is any interest I will post a summary.
----------------------------------------------------------------------------
Several of those who replied asked for a summary, so below is a summary of
the answers I got. At the end of the article is a long and informative
contribution that I got from Professor Greibach herself. [My own
comments are in brackets]. Thanks to all those who replied !
----------------------------------------------------------------------------
Eric Sven Ristad <RISTAD@edu.mit.ai.reagan> writes:
One reference I know of is:
Platek and Sgall (1978)
"A scale of context sensitive langauges: applications to natural languages"
Information and Control, 38(1), 1-20.
-----------------------------------------------------------------------------
Jose Rolim <rolim@dk.imada> writes:
I have worked with Greibach on approximation languages and its machine
correspondent. I am starting to think about special kinds of grammar
for approximation, which should be lying somewhere in the Chomsky hierarchy.
-----------------------------------------------------------------------------
Gilles Brassard <brassard@ca.umontreal.iro> writes:
Here is an easy one: the class of DETERMINISTIC context-free languages.
[ Yes, it IS an easy one and one that I knew of already. I guess I
should have written that I was after something a bit more `exotic'.
Sorry. The same comment applies to the reply below. ]
------------------------------------------------------------------------------
Mikael Pettersson <mpe@se.liu.ida> writes :
One interesting class of languages are the deterministic CFL's. They
lie properly between the regular languages and the CFL's and have the
important properties that they 1) need only deterministic PDA's as
their accepting automata, and 2) they are generated by a restricted
form of CFG's called the LR(1) grammars.
See Hopcroft&Ullman's "Introduction to Automata Theory, Languages
and Computation" for details.
------------------------------------------------------------------------------
mj@edu.brown.cs writes :
You should look at the work done by Aravind Joshi's group
at U. Penn. David Weir has found a heirarchy of languages
that can be characterized by the possible root-to-frontier
sequences of node-labels. As I recall, it goes roughly as
follows:
For CFGs, the root to frontier node label sequences are regular.
For index grammars, the node label sequences are CFGs.
Then David defined a heirarchy of languages (with these two
at the bottom) such that the root to frontier node label
sequences of a language of class k form a language of class k-1.
------------------------------------------------------------------------------
Daniel Sleator <sleator@com.dec.src> writes :
Have you seen the work of Roland Hausser? He has written a book
published by springer that contains his results on a new
language hierarchy. I forget the name of the book
He used to be in the linguistics department of
Carnegie Mellon University. I think he lives in Germany now. I suggest
calling the philosophy department at CMU to find out where he is now.
[If it wasn't for the fact that I cannot make overseas calls from my
office I would...]
-------------------------------------------------------------------------------
"Donald A. Varvel" <varvel@edu.utexas.cs> writes :
This may not be what you're looking for, but it seems marginally
relevant:
Macro grammars can describe some CS languages but not all, and
include all CF languages. There was some work done about 10
years ago at Iowa State.
Petri net languages include all regular languages, some CF, and some CS.
------------------------------------------------------------------------------
Weiping Shi <wshi@edu.uiuc.csg.ravel> writes :
We are working on a class of CFL which is a proper subset
of CFL, but does not include all regular sets. (We pose a natual
restriction on the production rules.) If you want to include
all regular sets, then linear, or k-ultralinear sets meet your
requirements.
------------------------------------------------------------------------------
And, finally, Dr Sheila Greibach <greibach@edu.ucla.cs.lanai> writes:
"Natural" is in the eye of the beholder, of course. Many -- indeed
infinitely many -- classes of (finitary) languages strictly between
REGULAR and CFL have been studied extensively, mostly in the 60s
and early 70s. Some types of classification by grammar are:
(1) Patterns of occurrences of nonterminals. Examples bounding
nonterminal occurrences; in each case, infinite hierarchy by bound
ultralinear -- bound on # of nonterminal occurrences that can appear
in ANY derivation = finite-turn pda =
no derivation X into uXv where uv contains a
nonterminal
derivation bounded -- bound on min # of nonterminal occurrences
that can appear in SOME derivation of a word = no
derivation X into uXvXw
left derivation bounded -- bound on # of nonterminal occurences
in left-to-right derivations
(2) Parsing -- examples
unambiguous
LR(k) = deterministic pda
(3) Templates
Any CF grammar can be taken as a "template" or "grammar scheme"
for a family of CF grammars. Sometimes this gives all CFL or only
regular; there are infinitely many "in-between" families.
There are also classifications by pda type, some of which are equivalent
to grammar classifications. And in AFL theory, we can take any nonregular
CFL L as a "template" and get a family of languages that properly
contains REGULAR and is contained in CFL; exactly when we get CFL
(i.e., L is a "generator") is still unsettled (undecidable of course).
A good text on CFL that contains many of these things:
%A Harrison, Michael
%T Introduction to Formal Language Theory
%I Addison-Wesley
%D 1978
AFLs are discussed in the book:
%A Ginsburg, S.
%T Algebraic and Automata-Theoretic Properties of Formal Languages
%I North-Holland/American Elsevier
%C Amsterdam
%D 1978
%K formal languages, AFL, context-free languages
A few random journal papers on subclasses of CFL (picked because
I have them handy on-line):
%A Gabrelian, A.
%A Ginsburg, S.
%T Grammar Schemata
%J JACM
%V 21
%P 213-226
%D 1974
%K grammar scheme, context-free, AFL
%A Ginsburg, S.
%A Spanier, E.
%T Derivation-bounded Languages
%J JCSS
%V 2
%P 228-250
%D 1968
%K context-free, derivation bounded
%A Ginsburg, S.
%A Spanier, E.
%T Finite-turn pushdown automata
%J SIAM J Control
%V 4
%P 429-453
%D 1966
%K pda, pushdown, finite-turn, ultralinear, context-free
%A Cremers, A.
%A Ginsburg, S.
%T Context-free grammar forms
%J JCSS
%V 11
%P 86-117
%D 1975
%K grammar form, context-free, AFL
%A Walljasper, S. J.
%T Left-derivation bounded languages
%J JCSS
%V 8
%P 1-7
%D 1974
%K context-free grammar, derivation, AFL
%A Yntema, M. K.
%T Inclusion Relations Among Families of Context-free Languages
%J Information and Control
%V 10
%P 572-597
%D 1967
%K context-free grammar, derivation-bounded
%A Kral, J.
%T A Modification of a Substitution Theorem and Some Necessary and Sufficient
Conditions for Sets to be Context-free
%J Mathematical Systems Theory
%V 4
%P 129-139
%D 1970
%K context-free, substitution
%A Banerji, R. B.
%T Phrase-structure languages, finite machines, and channel capacity
%J Information and Control
%V 6
%P 153-162
%D 1963
%K context-free grammar, linear, ultralinear
%A Parikh, R. J.
%T On context-free languages
%J JACM
%V 13
%P 570-581
%D 1966
%K context-free, inherent ambiguity, semilinear
%A Harrison, M. A.
%A Havel, I. M.
%T Strict deterministic grammars
%J JCSS
%V 7
%P 237-277
%D 1973
%K context-free grammar, pds, strict deterministic
%A Knuth, D. E.
%T On the translation of languages from left to right
%J Information and Control
%V 8
%P 607-639
%D 1965
%K deterministic context-free, LR(k), unambiguous
%A Greibach, S. A.
%T An Infinite Hierarchy of Context-free Languages
%J JACM
%V 16
%P 91-106
%D 1969
%K context-free, pda, pushdown, AFL
-------------------------------------------------------------------------------
| Hans H\"{u}ttel, Office 1603 JANET: hans@uk.ac.ed.lfcs
| LFCS, Dept. of Computer Science UUCP: ..!mcvax!ukc!lfcs!hans
| University of Edinburgh ARPA: hans%lfcs.ed.ac.uk@nsfnet-relay.ac.uk
| Edinburgh EH9 3JZ, SCOTLAND ... Ain't gonna work on Maggie's farm no more!
∂29-Jan-90 1336 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU FOCS'90 Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 13:35:57 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01275; Mon, 29 Jan 90 13:35:43 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08838; Mon, 29 Jan 90 13:35:33 -0800
Message-Id: <9001292135.AA08838@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9020; Mon, 29 Jan 90 15:33:40 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9001; Mon, 29 Jan 90 15:33:36 CST
Date: Mon, 29 Jan 90 15:32:46 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
mihalis@research.att.com
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: mihalis%research.att.com@VM1.NoDak.EDU
Subject: FOCS'90 Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Call For Papers
1990 IEEE Symposium on
Foundations of Computer Science
The 31st Annual IEEE Symposium on Foundations of Computer Science,
sponsored by the Computer Society's Technical Committee on
Mathematical Foundations of Computing, will be held in
St. Louis, Missouri on October 22-24, 1990.
Papers presenting original research on theoretical aspects of computer
science are sought. Topics include but are not limited to the following:
Algorithms and Data Structures Databases
Automata and Formal Languages Logic and Semantics of Programs
Computability and Complexity Theory Machine Learning
Computational Geometry and Robotics Parallel and Distributed Computation
Cryptography VLSI Computation and Design
Authors are requested to send 15 copies of an extended abstract
(not a full paper) by April 24, 1990 to the Program Committee chair:
Mihalis Yannakakis
Room 2C-319
AT&T Bell Laboratories
600 Mountain Avenue
Murray Hill, NJ 07974
Submissions or revisions received after April 24, 1990 will not be considered.
Authors will be notified of acceptance or rejection by June 25, 1990.
A camera ready copy of each accepted paper, prepared in a special format
for inclusion in the Symposium proceedings, will be due by August 10, 1990.
Simultaneous submission of the same abstract to FOCS and to another
conference with published proceedings is not allowed.
The only exception is the COLT'90 workshop, where dual
submission is governed by a separate agreement.
Submission format: An abstract should start with a succinct statement of
the problem, the main results achieved, an explanation of their
significance, and a comparison to previous work. This material should be
readily understandable to non-specialists. Technical development,
directed toward the specialist, should follow as appropriate.
The entire extended abstract must not exceed 2500 words or
10 double-spaced pages. Abstracts deviating significantly from these
guidelines will not be considered.
Meeting format: Authors of accepted papers will be expected to present
their work at the Symposium. The format of the meeting, including time
allocations for presentations and scheduling of sessions, will be
determined by the Program Committee. The Program Committee plans to accept
again this year more papers and compose a program of parallel sessions,
if warranted by the quality of the submitted papers.
Machtey Award for Best Student Paper: This award of up to $400, to help
defray the expenses for attending the Symposium, will be given for that
paper which the Program Committee judges to be the most outstanding paper
written solely by a student or students. To be considered for the award,
an abstract must be accompanied by a letter identifying all authors as
full-time students at the time of submission. At its discretion, the
Committee may decline to make the award or may split the award among two
or more papers.
Conference Chair: Program Committee Chair: Local Arrangements Chair:
Christos Papadimitriou Mihalis Yannakakis Jonathan Turner
EE&CS Department AT&T Bell Laboratories Computer Science Dept.
U.C. San Diego 600 Mountain Avenue Washington University
La Jolla, CA 92037 Murray Hill, NJ07974 St. Louis, MO 63130
Program Committee:
Don Coppersmith Richard Ladner Larry Stockmeyer
David Dobkin Michael Luby Moshe Vardi
Greg Frederickson Gary Miller Vijay Vazirani
David Haussler Vijaya Ramachandran Jeff Vitter
∂29-Jan-90 1426 chandler@Sunburn.Stanford.EDU Current CV
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 14:26:16 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25916; Mon, 29 Jan 90 14:27:02 -0800
Date: Mon, 29 Jan 1990 14:27:01 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: bigelow@cs.Stanford.EDU, binford@cs.Stanford.EDU, cheriton@cs.Stanford.EDU,
dantzig@cs.Stanford.EDU, dill@cs.Stanford.EDU,
feigenbaum@cs.Stanford.EDU, floyd@cs.Stanford.EDU,
genesereth@cs.Stanford.EDU, guibas@cs.Stanford.EDU,
hennessy@cs.Stanford.EDU, lam@cs.Stanford.EDU, latombe@cs.Stanford.EDU,
manna@cs.Stanford.EDU, mccarthy@cs.Stanford.EDU,
mccluskey@cs.Stanford.EDU, oliger@cs.Stanford.EDU,
pratt@cs.Stanford.EDU, ehs@sumex-aim.Stanford.EDU,
tobagi@cs.Stanford.EDU, ullman@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Current CV
Message-Id: <CMM.0.88.633652021.chandler@Sunburn.Stanford.EDU>
The most recent CV I have for you is at least one year old. If you have a
more current CV please send me a copy. Thanks much.
∂29-Jan-90 1432 LOGMTC-mailer tuesday seminar
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 14:32:13 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA07369; Mon, 29 Jan 90 14:32:21 -0800
Date: Mon, 29 Jan 90 14:32:21 -0800
From: Dinesh Katiyar <katiyar@Neon.Stanford.EDU>
Message-Id: <9001292232.AA07369@Neon.Stanford.EDU>
To: logmtc@sail
Subject: tuesday seminar
tuesday seminar
mjh 301
4:15 pm
Computing with an Equational Proof System
Brian T. Howard
Computer Science Department
Stanford University
Equational logic provides a simple mechanism for proving properties of
programs. For example, we may prove that the final result of a function
call is equal to 5, or that one procedure declaration may be replaced by
another. It is often possible to convert equational axioms about programs
into computation rules, giving in effect a non-deterministic interpreter
for the language. To be well-behaved, such an interpreter should produce
the same output regardless of the order in which the computation steps are
performed. For a simple but expressive functional language, straightforward
conversion of the equational proof system does not yield a well-behaved
interpreter, by the above criterion. However, we show that eliminating
certain computation rules restores the desired property, with no loss of
computational power. Moreover, the original equational proof system remains
sound for reasoning about computation. The computation rules we drop belong
to a general class of "extensionality" axioms. In general, we believe that
such equations may be proved to have no computational significance.
This is joint work with John Mitchell.
∂29-Jan-90 1527 chandler@Sunburn.Stanford.EDU Dept. of the Navy Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 15:27:11 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27540; Mon, 29 Jan 90 15:26:42 -0800
Date: Mon, 29 Jan 1990 15:26:41 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Dept. of the Navy Publication
Message-Id: <CMM.0.88.633655601.chandler@Sunburn.Stanford.EDU>
I have just received a publication from the Department of the Navy entitled
"Scientific information Bulletin" October to December 1989, Vol. 14, No. 4.
This is a rather large publication, so if you would like to see it, please
come by my office.
∂29-Jan-90 1519 helen@russell.Stanford.EDU [Brendan Busch <G.GONESKIING@Macbeth.Stanford.EDU>: programming work]
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 15:19:35 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA26191; Mon, 29 Jan 90 15:21:57 PST
Date: Mon 29 Jan 90 15:21:57-PST
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: [Brendan Busch <G.GONESKIING@Macbeth.Stanford.EDU>: programming work]
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <633655317.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
Here is a msg from an SSP student looking for work for $$ for this
quarter. He did some excellent work on our SSP Hypercard stack. --Helen
---------------
Return-Path: <G.GONESKIING@Macbeth.Stanford.EDU>
Received: from csli.Stanford.EDU by russell.Stanford.EDU (4.0/inc-1.0)
id AA23095; Mon, 29 Jan 90 11:12:02 PST
Received: from Macbeth.Stanford.EDU by csli.Stanford.EDU (4.0/inc-1.0)
id AA16038; Mon, 29 Jan 90 11:10:48 PST
Date: Mon 29 Jan 90 11:08:17-PST
>From: Brendan Busch <G.GONESKIING@Macbeth.Stanford.EDU>
Subject: programming work
To: helen@csli.Stanford.EDU
Message-Id: <12562149519.12.G.GONESKIING@Macbeth.Stanford.EDU>
I am a symbolic systems senior and am currently stopped out of school and
looking for programming work between now and next fall. I am fluent in C,
Pascal, Lisp, Prolog, and Hypercard, and have working knowledge of some other
languages. If you hear of any such work, I would be glad to interview with
those in charge. Please send me email at busch@csli, or call me at 324-3699.
Thank You,
Brendan Busch
-------
-------
∂29-Jan-90 1940 @Neon.Stanford.EDU:axwang@wolvesden.Stanford.EDU AFLB this Thursday
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 19:40:09 PST
Received: from wolvesden.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28578; Mon, 29 Jan 90 19:38:34 -0800
Received: by wolvesden.Stanford.EDU (5.61 (wolvesden 9/7/89)/inc-1.01)
id AA05773; Mon, 29 Jan 90 19:37:39 -0800
Message-Id: <9001300337.AA05773@wolvesden.Stanford.EDU>
To: aflb-all@neon.stanford.edu
Subject: AFLB this Thursday
Date: Mon, 29 Jan 90 19:37:37 PST
From: Alexander Wang <axwang@wolvesden.Stanford.EDU>
The speaker at AFLB this week will be Serge Plotkin (Stanford).
AFLB will meet at the usual time and place: Thursday, 12:00pm, MJH252.
NETWORK DECOMPOSITION AND LOCALITY IN DISTRIBUTED COMPUTATION
We introduce a concept of {\em network decomposition}, a
partitioning of an arbitrary graph into small-diameter connected
components, such that the graph created by contracting each
component into a single node has low chromatic number and low
arboricity. We present an efficient distributed algorithm for
constructing such a decomposition, and demonstrate its use for
design of efficient distributed algorithms.
Our method yields new deterministic distributed algorithms for
finding a maximal independent set in an arbitrary graph and for
$(\Delta+1)$-coloring of graphs with maximum degree $\Delta$.
These algorithms run in $O(n↑\epsilon)$ time for $\epsilon =
O(\sqrt{\log \log n / \log n})$, while the best previously known
deterministic algorithms required $\Omega (n)$ time. Our
techniques can also be used to remove randomness from the
previously known most efficient distributed breadth-first search
algorithm, without increasing the asymptotic communication and
time complexity.
Joint work with:
B. Awerbuch (MIT)
A. Goldberg (Stanford)
M. Luby (ICSI)
∂29-Jan-90 2255 LOGMTC-mailer CFP: Computer Science Logic
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Jan 90 22:55:01 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA13591; Mon, 29 Jan 90 22:55:20 -0800
Date: 30 Jan 90 01:00:12 GMT
From: vardi@Neon.Stanford.EDU (Moshe Y. Vardi)
Organization: Computer Science Department, Stanford University
Subject: CFP: Computer Science Logic
Message-Id: <1990Jan30.010012.28425@mcmi.uucp>
Sender: logmtc-mailer@sail.stanford.edu
To: logmtc@sail.stanford.edu
CSL'90
Computer Science Logic
October 1-5, 1990
Heidelberg, West Germany
First Announcement
and
CALL FOR PAPERS
The fourth workshop on Computer Science Logic will be held from Monday,
October 1, to Friday, October 5, 1990, in Heidelberg (West Germany).
This is the fourth in a series of workshops on concepts and methods of
logic which are relevant for computer science. The first three
workshops took place in Karlsruhe (1987), in Duisburg (1988) and in
Kaiserlautern (1989). Both, computer scientists whose research
activities involve logic and logicians working on algorithmic
aspects of logical problems, are invited to attend the workshop.
The scientific program will consist of invited lectures and of short
contributions which will be selected from the submitted papers. All
contributions will be refereed for a proceedings volume.
An extended abstract (1-2 pages) of submitted papers should be sent to
the program committee chairman (W. Schoenfeld) not later than June 1,
1990. The authors will be notified of acceptance for presentation to
the workshop by July 15, 1990. The preliminary version of the complete
paper should be ready for the workshop. The final camera-ready versions
of the paper for inclusion in the workshop proceedings will be due
December 1, 1990.
By January 15, 1991, the authors will be notified of acceptance of their
papers for the proceedings volume.
The conference fee is DM 80,--.
Program Committee and Organizers: E. Boerger (Pisa/Heidelberg)
H. Kleine Buening (Duisburg)
M.M. Richter (Kaiserslautern)
W. Schoenfeld (Heidelberg)
Program Committee Chairman: W. Schoenfeld
Correspondence should be sent to:
Prof. Dr. Wolfgang Schoenfeld
IBM Deutschland GmbH
Wissenschaftliches Zentrum
Postfach 10 30 68
6900 Heidelberg
Federal Republic of Germany
--
My God, look at the suits!
-Karl
∂30-Jan-90 0756 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Conference Announcement - CTRS90
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 07:55:51 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05925; Tue, 30 Jan 90 07:55:41 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20914; Tue, 30 Jan 90 07:52:12 -0800
Message-Id: <9001301552.AA20914@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4122; Tue, 30 Jan 90 09:50:44 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4109; Tue, 30 Jan 90 09:50:41 CST
Date: Tue, 30 Jan 90 09:49:21 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
OKADA <ctrs90@clyde.concordia.ca>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: OKADA <ctrs90%clyde.concordia.ca@VM1.NoDak.EDU>
Subject: Conference Announcement - CTRS90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
THE SECOND INTERNATIONAL WORKSHOP ON CONDITIONAL
AND TYPED REWRITING SYSTEMS
(CTRS '90)
June 11-14, 1990, Montreal, Canada
-- FIRST ANNOUNCEMENT --
Sponsored by
Centre de recherche informatique de Montreal
and
Concordia University
In recent years, extensions of rewriting techniques that go
beyond the traditional untyped algebraic rewriting framework have
been investigated and developed. Among these extensions,
conditional and typed systems are particularly important, as are
higher-order systems, graph rewriting systems, etc.
To further research in these and related areas, the Second
International Workshop will be held next summer. Topics will
include the theory of conditional rewriting and its application
to programming languages, specification languages, automated
deduction, as well as typed rewriting, higher-order rewriting,
graph rewriting, combinator based languages, and their
application to parallel architectures, parallel computation
models, and compilation techniques. (This list is not meant to
be exhaustive.) Sessions for formal presentations of papers, for
system demonstrations, and for informal discussion are scheduled.
Speakers for keynote lectures to introduce discussion sessions include
V. Breazu-Tannen & J. Gallier, H. Ganzinger, J. Hsiang, J. W. Klop,
J. Meseguer, and J. L. Remy.
We are soliciting research papers for the presentation sessions
and system description papers for the demonstration sessions.
Ongoing work is also welcome. An extended abstract (of around
5 pages) or a draft paper should be submitted by February 23,
1990 (or earlier). In parallel, an e-mailed abstract of no more
than 25 lines may be sent to 'ctrs90@concour.cs.concordia.ca'.
Notice of acceptance will be sent within one month of our receipt
of the submission. Springer has expressed their intention to
continue publication of the CTRS Workshop proceedings in
the Lecture Notes in Computer Science series. The proceedings
of the first workshop (on "Conditional Term Rewriting Systems")
are available as volume 308 of the same series. (The related
"Rewriting Techniques and Applications" conference proceedings
are in vols. 202, 256, and 355.)
Program Committee:
R. V. Book (University of California - Santa Barbara, USA)
N. Dershowitz (*) (University of Illinois, USA)
K. Futatsugi (Electrotechnical Lab (ETL), Japan)
H. Ganzinger (Universitaet Dortmund, West Germany)
J. P. Jouannaud (*) (Universite de Paris-Sud, France)
S. Kaplan (*) (Hebrew University, Israel)
J. W. Klop (Mathematisch Centrum, Netherlands)
J. Meseguer (SRI-International, USA)
M. Okada (*)(**) (Concordia University, Canada)
D. Plaisted (University of North Carolina, USA)
J. L. Remy (Universite de Nancy, France)
(*) Co-organizers
(**) Chairperson
For further information or proposals, as well as for paper
submissions, please use the following address:
CTRS '90
Dr. Mitsuhiro Okada
Department of Computer Science
Concordia University
1455 de Maisonneuve Ouest
Montreal, Quebec H3G 1M8
Canada
∂30-Jan-90 0759 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Post STOC workshop -- Workshop on Parallel Algorithms
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 07:58:52 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05950; Tue, 30 Jan 90 07:58:42 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21011; Tue, 30 Jan 90 07:55:58 -0800
Message-Id: <9001301555.AA21011@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4159; Tue, 30 Jan 90 09:52:29 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4138; Tue, 30 Jan 90 09:51:14 CST
Date: Tue, 30 Jan 90 09:49:37 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Uzi Vishkin <vishkin@umiacs.UMD.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Uzi Vishkin <vishkin%umiacs.UMD.EDU@VM1.NoDak.EDU>
Subject: Post STOC workshop -- Workshop on Parallel Algorithms
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
WORKSHOP ON PARALLEL ALGORITHMS
May 17-18, 1990
Radisson Annapolis Hotel
Invited talks by leading researchers in the field of parallel computation
will be presented at an informal workshop on May 17-18, 1990 at the
Radisson Annapolis Hotel in Annapolis, Maryland.
The workshop is funded by a joint grant, with New York University,
from the National Science Foundation and the Defense Advanced Research
Projects Agency, with additional support from the University of Maryland
Institute for Advanced Computer Studies, (UMIACS). It
immediately follows the annual ACM Symposium on Theory of Computing (STOC) in
Baltimore, Maryland.
The invited speakers will include:
Faith Fich, University of Toronto
Joseph JaJa, University of Maryland
Rao Kosaraju, Johns Hopkins University
Tom Leighton, Massachusetts Institute of Technology
Vijaya Ramachandran,University of Texas at Austin
John Reif, Duke University
Burton Smith, Tera Computer Company
Leslie Valiant, Harvard University
A panel discussion on "The Future Directions
of Parallel Computation" will be held on the evening of May 17, 1990.
The meeting will end by 4 pm on May 18.
\fBRegistration\fR:
A $50 registration fee includes 2 lunches, a welcome reception on
May 17th and conference materials.
\fBTransportation\fR. The Radisson Annapolis Hotel, located
approximately 28 miles from the Baltimore/Washington International
Airport, provides round trip shuttle service.
A bus will leave the STOC hotel in Baltimore at 6 pm on Wednesday, May 16.
Seats are available for a nominal fee.
\fBAccomodation\fR: A limited number of double
and single rooms reserved at a discounted rate of $85 per night
is available for workshop participants.
\fBDeadline\fR. Our contract with the hotel forces us to impose a deadline
for registration and accomodation.
Attached is a registration and hotel reservation form due by April 10, 1990.
\fBFurther information\fR.
Contact Dawn Vance at (301) 454-1808 or by e-mail, dawn@umiacs.
umd.edu. If you have questions regarding the technical content of the
program, contact the workshop organizer, Prof. Uzi Vishkin,
at (301) 454-1988 or vishkin@umiacs.umd.edu
______________
Workshop on Parallel Algorithms
May 17-18, 1990
Radisson Annapolis Hotel - Annapolis, Maryland
REGISTRATION AND HOTEL RESERVATION FORM
Name: _______________________________________________________
Affiliation: _______________________________________________________
Address: _______________________________________________________
_______________________________________________________
_______________________________________________________
Phone: _______________________________________________________
E-mail: _______________________________________________________
Hotel accommodations needed: _____ Yes _____ No
Type of room needed: _____ $85 Single _____ $85 Double
Tentative arrival/departure dates: _____ Arr. _____ Dep.
Dawn: credit card (for late arrival----
Trasportation needed: _____ Yes _____ No
Registration Fee - $50.00. Registration fee includes lunch on Thursday
and Friday; a welcome reception; and conference materials.
Please make checks payable to the University of Maryland Foundation -
Parallel Algorithms Workshop. Mail check and registration form by
April 10, 1990 to:
Dawn Vance
UMIACS
A.V. Williams Building
University of Maryland
College Park, MD 20742
For further information, contact Dawn Vance by e-mail at dawn@umiacs.umd.
edu or by calling (301) 454-1808.
∂30-Jan-90 0801 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Monkey puzzles and NP-completeness
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 08:01:14 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06008; Tue, 30 Jan 90 08:01:20 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21052; Tue, 30 Jan 90 07:59:10 -0800
Message-Id: <9001301559.AA21052@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4217; Tue, 30 Jan 90 09:54:33 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4178; Tue, 30 Jan 90 09:51:45 CST
Date: Tue, 30 Jan 90 09:49:54 CST
Reply-To: Anne Lomax <al%cs.nott.ac.uk@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Anne Lomax <al%cs.nott.ac.uk@VM1.NoDak.EDU>
Subject: Monkey puzzles and NP-completeness
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Can anyone help me to prove that the MONKEY PUZZLE problem is NP-complete?
I want to use the proof as an example in a course I'm giving that covers
basic NP-completeness proofs. Garey and Johnson (in their book "Computers
and Intractability") quote some unpublished results for the SQUARE-TILING
problem which looks similar. That involves an unspecified transformation
from DIRECTED HAMILTONIAN PATH. Harel (in "Algorithmics") talks about the
MONKEY PUZZLE problem as a member of NPC, but I can't see a specific
reference to a proof.
Here's the problem description as I understand it:
INSTANCE: N↑2 cards having tops or bottoms of various different
colours of "monkey" drawn on the edges.
QUESTION: Is there and arrangement of the cards in an N X N square
such that there are complete matching monkeys where the
cards join? [We can assume a fixed orientation for the cards.]
Thanks in advance,
Anne Lomax.
∂30-Jan-90 0802 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU FOCS'90 Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 08:02:00 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06019; Tue, 30 Jan 90 08:01:56 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21069; Tue, 30 Jan 90 08:01:36 -0800
Message-Id: <9001301601.AA21069@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4273; Tue, 30 Jan 90 09:57:35 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4258; Tue, 30 Jan 90 09:52:33 CST
Date: Tue, 30 Jan 90 09:51:54 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
mihalis@research.att.com
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: mihalis%research.att.com@VM1.NoDak.EDU
Subject: FOCS'90 Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Call For Papers
1990 IEEE Symposium on
Foundations of Computer Science
The 31st Annual IEEE Symposium on Foundations of Computer Science,
sponsored by the Computer Society's Technical Committee on
Mathematical Foundations of Computing, will be held in
St. Louis, Missouri on October 22-24, 1990.
Papers presenting original research on theoretical aspects of computer
science are sought. Topics include but are not limited to the following:
Algorithms and Data Structures Databases
Automata and Formal Languages Logic and Semantics of Programs
Computability and Complexity Theory Machine Learning
Computational Geometry and Robotics Parallel and Distributed Computation
Cryptography VLSI Computation and Design
Authors are requested to send 15 copies of an extended abstract
(not a full paper) by April 24, 1990 to the Program Committee chair:
Mihalis Yannakakis
Room 2C-319
AT&T Bell Laboratories
600 Mountain Avenue
Murray Hill, NJ 07974
Submissions or revisions received after April 24, 1990 will not be considered.
Authors will be notified of acceptance or rejection by June 25, 1990.
A camera ready copy of each accepted paper, prepared in a special format
for inclusion in the Symposium proceedings, will be due by August 10, 1990.
Simultaneous submission of the same abstract to FOCS and to another
conference with published proceedings is not allowed.
The only exception is the COLT'90 workshop, where dual
submission is governed by a separate agreement.
Submission format: An abstract should start with a succinct statement of
the problem, the main results achieved, an explanation of their
significance, and a comparison to previous work. This material should be
readily understandable to non-specialists. Technical development,
directed toward the specialist, should follow as appropriate.
The entire extended abstract must not exceed 2500 words or
10 double-spaced pages. Abstracts deviating significantly from these
guidelines will not be considered.
Meeting format: Authors of accepted papers will be expected to present
their work at the Symposium. The format of the meeting, including time
allocations for presentations and scheduling of sessions, will be
determined by the Program Committee. The Program Committee plans to accept
again this year more papers and compose a program of parallel sessions,
if warranted by the quality of the submitted papers.
Machtey Award for Best Student Paper: This award of up to $400, to help
defray the expenses for attending the Symposium, will be given for that
paper which the Program Committee judges to be the most outstanding paper
written solely by a student or students. To be considered for the award,
an abstract must be accompanied by a letter identifying all authors as
full-time students at the time of submission. At its discretion, the
Committee may decline to make the award or may split the award among two
or more papers.
Conference Chair: Program Committee Chair: Local Arrangements Chair:
Christos Papadimitriou Mihalis Yannakakis Jonathan Turner
EE&CS Department AT&T Bell Laboratories Computer Science Dept.
U.C. San Diego 600 Mountain Avenue Washington University
La Jolla, CA 92037 Murray Hill, NJ07974 St. Louis, MO 63130
Program Committee:
Don Coppersmith Richard Ladner Larry Stockmeyer
David Dobkin Michael Luby Moshe Vardi
Greg Frederickson Gary Miller Vijay Vazirani
David Haussler Vijaya Ramachandran Jeff Vitter
∂30-Jan-90 0925 chandler@Sunburn.Stanford.EDU Today's Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 09:25:09 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11355; Tue, 30 Jan 90 09:25:20 -0800
Date: Tue, 30 Jan 1990 9:25:18 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Today's Faculty Lunch
Message-Id: <CMM.0.88.633720318.chandler@Sunburn.Stanford.EDU>
Looking forward to seeing you all at today's faculty lunch. Joe Goodman,
Chairman of EE will be our guest and will talk about new directions in the
Electrical Engineering Department.
TODAY, 12:15 IN MJH-146.
∂30-Jan-90 1109 jimenez@Sunburn.Stanford.EDU IBM
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 11:09:26 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13905; Tue, 30 Jan 90 11:08:46 -0800
Date: Tue, 30 Jan 1990 11:08:46 PST
From: Tina Jimenez <jimenez@Sunburn.Stanford.EDU>
To: Instructors@cs.Stanford.EDU
Cc: su-market@Sunburn.Stanford.EDU, su-etc@Sunburn.Stanford.EDU,
mscs@cs.Stanford.EDU, jimenez@Sunburn.Stanford.EDU
Subject: IBM
Message-Id: <CMM.0.88.633726526.jimenez@Sunburn.Stanford.EDU>
==============================================================================
IBM IS LOOKING FOR CREATIVE IDEAS ON
HOW TO PRODUCE SOFTWARE MORE EFFICIENTLY.
=============================================================================
Would you like the opportunity to share your ideas
and earn $40.00 through participation in a two hour
discussion of software development productivity?
If so, please call Mike Dockter at IBM (408-463-3587).
If Mike is not there, leave your name and phone number
and Mike will return your call.
The discussion will be held Friday, February 2nd.
The meeting time and location will be confirmed with each attendee.
==============================================================================
∂30-Jan-90 1144 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU 25th Anniversary
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 11:44:32 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15626; Tue, 30 Jan 90 11:43:47 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA06372; Tue, 30 Jan 90 11:37:51 PST
Date: Tue, 30 Jan 90 11:37:51 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9001301937.AA06372@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: 25th Anniversary
Cc: fullerton@sierra.stanford.edu, gibbons@sierra.stanford.edu
As discussed at last week's faculty lunch, the Stanford Computer
Science Dept. this year celebrates its 25th anniversary. Although
Jeff Ullman commented that perhaps it would be more appropriate
to honor our 32nd birthday rather than our 25th, there are important
advantages to us linking some kind of celebration to Stanford's ongoing
Centennial campaign. (It appears that the Development Office can
help with logistic and financial support.)
Our lunch discussion followed a smaller discussion in which Ed
Feigenbaum,
Gene Golub, Jack Herriot, Bill Miller, and I participated. We observed
that there are several reasons why we might want to mark this
anniversary: 1) To celebrate our many achievements during the
last quarter century, 2) To build cohesion within the Department and
to link it with our many graduates, former members, and friends, 3) To
make us and our friends feel good about our association with such
a fine Department, 4) To create an occasion in which Stanford University
as a whole can take note of the prominence of the Department and of
its strong support in the world at large, and 5) To help raise funds for
our planned new building and other Departmental purposes. (Perhaps
there are other reasons also.)
In planning a celebratory event, we should think carefully about which of
these purposes motivates us. Some kinds of events will achieve only
a limited subset of these purposes. At the faculty lunch Ed Feigenbaum
described a spectrum of possibilities ranging from minimalist to maximalist
events. An example of a maximalist event would be one which included
some combination of 1) a day or so of talks by faculty members and
possibly others; 2) a reception and/or lunch in which our friends, graduates,
etc. can gather to renew acquaintances, etc.; and 3) a banquet to which
potential large donors and other important computer people would be invited
(perhaps some videos and a speech would occur at the banquet). It
seemed that people attending the faculty lunch favored a maximalist
event.
It will take time to plan and produce a big event. Probably one could
not occur before Fall Quarter, but it should happen in 1990 because that
is our 25th year. People suggested the week before Fall Quarter; others
think that dead week of Fall Quarter would be OK. Probably we could
count on help from Development Office staff, and we could hire
out some of the logistical work. BUT to do this right, we will need someone
knowledgeable about computer science and our Department to be the
overall "point person." This is the person the hired guns, the Development
Office, etc. will look to for direction. This is the person at which "the buck
stops." Who will that be? It is clear that if we can't find someone who would
like to do this, we probably cannot put on the maximalist event.
The purpose of this note is to bring us up to date on this matter, to solicit
advice, and to find out if there is anyone out there who would like to
volunteer to be "the point person."
-Nils
∂30-Jan-90 2043 jones@Sunburn.Stanford.EDU Mathematica
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Jan 90 20:43:12 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA01041; Tue, 30 Jan 90 20:43:37 -0800
Date: Tue, 30 Jan 1990 20:43:36 PST
From: "H. Roy Jones" <jones@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: Mathematica
Message-Id: <CMM.0.88.633761016.jones@Sunburn.Stanford.EDU>
SITN is interested in doing a mathematica short course. Is anyone interested
in doing it?
Roy
∂31-Jan-90 0856 hemenway@Sunburn.Stanford.EDU Round 1
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 08:56:49 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07216; Wed, 31 Jan 90 08:57:28 -0800
Date: Wed, 31 Jan 1990 8:57:27 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Round 1
Message-Id: <CMM.0.88.633805047.hemenway@Sunburn.Stanford.EDU>
To reiterate what we discussed at yesterday's meeting, the schedule
of readings for Round 1 is:
Available (after 4:00) Due (by 10:00)
______________________ _________________
Batch 1 Friday, Feb. 2 Monday, Feb 5
Batch 2 Monday, Feb. 5 Thursday, Feb. 8
Batch 3 Thursday, Feb. 8 Monday, Feb. 12
Batch 4 Monday, Feb. 12 Thursday, Feb. 15
I will put a box outside of my office door (MJH 258) where you may
either pick up or drop off your folders, if outside of normal office
hours. I need to know exactly how many readers to divide the available
folders among for each batch so please be sure to let me know if you
cannot do any of the 4 batches. Also, since we need to enter all of
the ratings and reshuffle the folders between batches, it is very
important that we get the folders back in time.
As a reminder, you may assign any value between 1 and 5, to two
decimal places, for the ratings. I think you'll find that writing
comments (to yourself) on the rating sheets will be very helpful at
the Round 1 and Round 2 meetings where we will hand back your rating
sheets.
Please, if you notice any errors on the rating sheets (incorrect GPA,
GRE scores, school, etc.) let us know and we will correct it for the
next round.
Many thanks for your help--
Sharon
∂31-Jan-90 0931 tom@Sunburn.Stanford.EDU chilled water shutdown
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 09:30:56 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08334; Wed, 31 Jan 90 09:31:02 -0800
Date: Wed, 31 Jan 90 09:31:02 -0800
From: Tom Dienstbier <tom@Sunburn.Stanford.EDU>
Message-Id: <9001311731.AA08334@Sunburn.Stanford.EDU>
To: csd@Sunburn.Stanford.EDU, faculty@Sunburn.Stanford.EDU,
su-computers@Sunburn.Stanford.EDU
Subject: chilled water shutdown
Folks we have just been notified that the chilled water, which cools
our building and machine rooms, will be shut off to facilitate a tie-in
of a new section of line(probably for Near West/Biology building). The
time of the shutdown will be on Friday Febuary 2, 2400 hours through
Sunday Febuary 4, somewhere around 0800 hours. We expect to be able to
keep all machines running with the use of outside air and lots of
fans. Hopefully the days will continue to stay cool.
Tom Dienstbier
CSDCF
∂31-Jan-90 1003 hemenway@Sunburn.Stanford.EDU Round 1 Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 10:03:10 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10522; Wed, 31 Jan 90 10:03:46 -0800
Date: Wed, 31 Jan 1990 10:03:45 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Round 1 Meeting
Message-Id: <CMM.0.88.633809025.hemenway@Sunburn.Stanford.EDU>
We need to arrive at a firm date for the Round 1 meeting (during which
we decide on the Early Admits and pick the 80+ applications which will
move onto Round 2). In order not to push our final decision meeting
too late, we need to have it at the very beginning of the week of Feb.
19. We probably need to plan on a 3-hour block of time.
Our choices are basically to have it either on that Monday (the
"President's Day" holiday) or Tuesday, the 20th. (Friday, the 16th,
is another option although I'm concerned about our ability to get all
the necessary reports out by then so I'd like to leave it as a last
resort.)
So, please let me know what your constraints are for the 19th and 20th
(and the 16th, I suppose). While we will aim for a time at which
everyone can attend, we probably will end up compromising a bit.
Thanks much.
Sharon
∂31-Jan-90 1126 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Round 1 Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 11:26:08 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13824; Wed, 31 Jan 90 11:26:34 -0800
Received: by coraki.stanford.edu (4.1/25-eef) id AA10693; Wed, 31 Jan 90 11:26:24 PST
Message-Id: <9001311926.AA10693@coraki.stanford.edu>
To: "Sharon R. Hemenway" <hemenway@sunburn.stanford.edu>
Cc: phd-adm@sunburn.stanford.edu
Subject: Re: Round 1 Meeting
In-Reply-To: Your message of Wed, 31 Jan 1990 10:03:45 PST.
<CMM.0.88.633809025.hemenway@Sunburn.Stanford.EDU>
Date: 31 Jan 90 11:26:23 PST (Wed)
From: pratt@cs.Stanford.EDU
Our choices are basically to have it either on that Monday (the
"President's Day" holiday) or Tuesday, the 20th.
I'll be in Yosemite with my family on the long weekend. I would object
strongly to scheduling this critical meeting during the long weekend.
-v
∂31-Jan-90 1334 ingrid@russell.Stanford.EDU CSLI Calendar, 1 February 1990, vol. 5:15
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 13:34:12 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA12715; Wed, 31 Jan 90 13:04:00 PST
Date: Wed, 31 Jan 90 13:04:00 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001312104.AA12715@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 1 February 1990, vol. 5:15
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
1 February 1990 Stanford Vol. 5, No. 15
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 1 FEBRUARY 1990
12:00 noon TINLunch
Cordura 100 Reading: A Logical Model of Machine Learning:
A Study of Vague Predicates
by Wlodek Zadrozny and Mieczyslaw Kokar
Discussion led by Jerry Hobbs
(hobbs@ai.sri.com)
Abstract in last week's Calendar
2:15 p.m.
Cordura 100 CSLI Seminar
Some Aspects of Word-Retrieval Errors in the
Speech of Aphasic Adults
Audrey Holland
Professor of Otolaryngology and Communication
and Associate Professor of Psychiatry
Director of the Division of Speech, Language,
and Voice Pathology, School of Medicine
University of Pittsburgh
(alh@med.pitt.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 8 FEBRUARY 1990
12:00 noon TINLunch
Cordura 100 Reading: Peirce on Truth
by H. S. Thayer
Discussion led by Tom Burke
(burke@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Reading: Peirce on Truth, by H. S. Thayer
Discussion led by Tom Burke
For C. S. Peirce, truth is what would be uncovered in the ideal limit
of endless scientific inquiry. Moore, Russell, Ayer, Quine, and
others have given numerous reasons to believe this is unacceptable as
an account of truth. But many of these criticisms rest on a failure
to distinguish (a) what it _means_ to say, (b) how to _know_, and (c)
how one might come to _believe_, that a statement is true. Many of
the complaints revolve around questioning the feasibility of the
notion of endless scientific inquiry. There is also an apparent
incoherence in Peirce's saying that a statement is true if it is in
concordance with the ideal limit of endless investigation and yet, in
the very same breath, saying that an essential ingredient in this
concordance is some sort of confessed inaccuracy and one-sidedness --
as if to say that a statement isn't true unless it confesses not to
be? Well, that isn't what Peirce was saying, and Thayer's article
helps to straighten all this out.
Peirce's view of truth is relevant to a number of topics in situation
theory. If time permits, we might discuss various notions of
partiality, persistence and nonpersistence, and the distinction
between saturated and unsaturated infons. The last half-dozen pages
of John Perry's "From Worlds to Situations" will be included with
the reading.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
John Etchemendy
(etch@csli.stanford.edu)
Thursday, 1 February, 3:45-5:30 p.m.
Cordura 100
This week, I will finish up my presentation of _The Liar_. For those
of you who weren't at last week's meeting, I ran out of time just
after describing what we call the Russellian treatment. I will talk
about the preferred (by us) Austinian treatment Thursday.
Bernie Linsky's presentation of Anderson's chapter on Intensional
Logic has been postponed until next week.
____________
SYMBOLIC SYSTEMS FORUM
Verb Varieties: Syntax or Semantics?
Annie Zaenen
(zaenen.pa@xerox.com)
Thursday, 1 February, 4:15 p.m.
Building 60, Room 61G
Traditional grammars and dictionaries generally subdivide verbs into
transitive and intransitive ones. It is, however, well known that
finer classifications are needed in linguistic description. In this
talk, I'll discuss the differences between two classes of intransitive
verbs in Dutch and Italian and show how their syntactic differences
correlate with subtle differences in meaning.
A discussion of the differences between Italian and Dutch will raise
the problem of how word meaning corresponds with what is "out in the
real world."
____________
MATHEMATICS DEPARTMENT COLLOQUIUM
Unique Continuation for Elliptic Differential Inequalities
Tom Wolff
California Institute of Technology
Thursday, 1 February, 4:15 p.m.
Building 380, Room 380W
No abstract available.
____________
HISTORICAL LINGUISTICS GROUP
The Sociolinguistic Types of Language
Gregory Guy
(guy@csli.stanford.edu)
Thursday, 1 February, 7:30 p.m.
Ventura 17
Many authors have distinguished various "types" of linguistic change.
For example, there is Labov's (1966) dichotomy between "change from
above" and "change from below," Naro and Lemle's contrast between
"natural" and "conscious imitative" changes, and Bickerton's (1980)
distinction between "spontaneous" and "nonspontaneous" changes. These
dichotomies all depend on, among other criteria, whether or not
language or dialect contact is involved in their genesis. More recent
works by Thomason and Kaufman (1988) and Van Coetsem (1988) provide
richer "typologies," drawing for example an important distinction
between contact-induced changes that arise through borrowing and those
that arise from the imposition of native-language habits on a second
language.
The present paper attempts to summarize and critique some of the major
proposals concerning change types, and to provide a systematic
synthesis that identifies three basic types (untargeted change,
borrowing, and imposition). Each of these is associated with a
distinctive set of social, psychological, and linguistic
characteristics, such as the social class distribution and social
motivation of a change, whether speakers are consciously aware of the
innovation, the linguistic distribution of innovations according to
the saliency of contexts and the structural levels involved. A number
of variable parameters that allow the characterization of intermediate
types are also explored, such as (in contact-induced change) the
degree of bilingualism and the demographic balance between the
languages, and (in untargeted change) the possible coexistence of
contrasting social interpretations of the innovation (e.g., "overt"
and "covert" norms).
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Scientific Knowledge: Taking up the Feminist
Challenge to Philosophy of Science
Helen Longino
Department of Philosophy, Mills College
Friday, 2 February, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Dissertation Proposal
John Stonham
(stonham@csli.stanford.edu)
Friday, 2 February, 3:30 p.m.
Cordura 100
In this proposal, I will present my ongoing research on the use of
processes in morphology. I will describe and reanalyze several cases
of grammatically conditioned metathesis, showing that they lend
themselves better to some other form of analysis. The metathesis is
then only a surface realization of the restructuring of the syllable,
the observance of phonotactic constraints or some other
nonmorphological effect. I will suggest that we should never expect
to find metathesis as a grammatical marker, only as a phonological or
phonetic effect due to various factors that exist in language.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
A Characterization of Maximum Entropy Epsilon Semantics
Paul Morris
IntelliCorp
Monday, 5 February, 2:30 p.m.
Margaret Jacks Hall 252
This is joint work with Moises Goldszmidt and Judea Pearl of UCLA. A
solution to the Yale shooting problem due to Geffner and Pearl
represents frame axioms by means of extreme conditional probabilities,
or epsilon semantics. However, the solution goes beyond epsilon
semantics in using a principle of irrelevance, which has been thought
to be related to maximum entropy.
We characterize maximum entropy epsilon semantics for an important
class of rule sets as a preference for worlds that minimize a specific
weighted count of rule violations. The result shows that an
application of maximum entropy to a variant of the shooting problem
gives a counter-intuitive result, whereas the principle of irrelevance
is in accord with intuition. Thus, the two approaches are not
identical. We also present some relationships between probabilistic
and default reasoning that extend results of Kraus, Lehmann, and
Magidor.
____________
LANGUAGE ACQUISITION INTEREST GROUP
Workshop on Steve Pinker's Theory of the
Acquisition of Argument Structures
Discussion led by Jess Gropen
Visiting Postdoctoral Fellow, MIT
Tuesday, 6 February, 12:00 noon
Building 100, Greenberg Room
Readings:
(1) Pinker, S. 1987. Resolving a Learnability Paradox in the
Acquisition of the Verb Lexicon. In _Lexicon Project Working
Paper_ 17. Cambridge, Mass.: MIT Center for Cognitive Science.
Workshop participants are encouraged to read the above paper before
attending the workshop. Three copies of the paper have been put on
reserve in the Greenberg Room.
(2) Pinker, S. 1989. _Learnability and Cognition_. Cambridge,
Mass.: MIT Press.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Beyond Heuristics and Biases:
How to Make Cognitive Illusions Disappear
Gerd Gigerenzer
University of Konstanz
Wednesday, 7 February, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
∂31-Jan-90 1425 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CAAP/ESOP final programme, Copenhagen, May 15-18, 1990
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 14:25:46 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12882; Wed, 31 Jan 90 14:25:12 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12323; Wed, 31 Jan 90 14:16:49 -0800
Message-Id: <9001312216.AA12323@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2386; Wed, 31 Jan 90 16:13:48 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2365; Wed, 31 Jan 90 16:13:31 CST
Date: Wed, 31 Jan 90 16:12:26 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Peter Sestoft <mcsun!sunic!dkuug!freja!sestoft@uunet.uu.net>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Peter Sestoft <mcsun!sunic!dkuug!freja!sestoft%uunet.uu.net@VM1.NoDak.EDU>
Subject: CAAP/ESOP final programme, Copenhagen, May 15-18, 1990
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Fifteenth Colloquium on Trees in Algebra and Programming (CAAP)
Third European Symposium on Programming (ESOP)
May 15-18, 1990
H.C. Oersted Institutet, Universitetsparken 5,
DK-2100 Copenhagen Oe, Denmark
Sponsored by the European Association for Theoretical Computer Science
SCIENTIFIC PROGRAM
TUESDAY, MAY 15, 1990
9:15 - 9:30 Opening
First ESOP session: chairman: John Hughes (Glasgow)
9:30 - 10:30 Invited lecture: Generalised Type Systems, Henk P.
Barendregt (U. of Nijmegen)
11:00 - 11:30 Type Inference for Action Semantics, S. Even and D.A.
Schmidt (Kansas State U., Manhattan)
11:30 - 12:00 Set Domains, R. Heckmann, (U. des Saarlandes, Saarbruecken)
12:00 - 12:30 Type Inference and Implicit Scaling, S. Thatte (Clarkson U., NY)
First CAAP session (parallel session): chairman: M. Jantzen (Hamburg)
13:30 - 14:00 A Markovian Concurrency Measure, D. Geniet (U. Paris XI), R.
Schott (C.R.I.N., U. Nancy I, France) and L. Thimonier (U. Paris XI and U. de
Picardie, Amiens, France)
14:00 - 14:30 Equivalence of Finite-Valued Bottom-up Finite State Tree
Transducers Is Decidable, H. Seidl (U. des Saarlandes, Saarbruecken)
14:30 - 15:00 A Unified Approach for Showing Language Containment and
Equivalence between Various Types of omega-Automata, E.M. Clarke and I.A.
Draghicescu (Carnegie Mellon U.) and R.P. Kurshan (AT&T Bell Laboratories,
Murray Hill)
Second ESOP (parallel) session: chairman: Reinhard Wilhelm (Saarbruecken)
13:30 - 14:00 Implementing Finite-domain Constraint Logic Programming on Top
of a Prolog-system with Delay-mechanism, D.De Schreye, D. Pollet, J. Ronsyn,
M. Bruynooghe (Katholieke U. Leuven, Belgium)
14:00 - 14:30 Implementation of an Interpreter for a Parallel Language in
Centaur, Y. Bertot (INRIA, Sophia Antipolis, France)
14:30 - 15:00 Techniques for Improving Grammar Flow Analysis, M. Jourdan and
D. Parigot (INRIA, Rocquencourt, France)
Third ESOP session: chairman: Harald Ganzinger (Dortmund)
15:30 - 16:00 From Interpreting to Compiling Binding Times, Ch. Consel
(Yale U., New Haven) and O. Danvy (Indiana U., Bloomington)
16:00 - 16:30 Arity Raiser and Its Use in Program Specialization, S.A.
Romanenko (Keldysh Institute of Applied Mathematics, Moscow)
16:30 - 17:00 Automatic Autoprojection of Higher Order Recursive Equations,
A. Bondorf (DIKU, Copenhagen)
WEDNESDAY, MAY 16, 1990
Second CAAP session: chairman: P. Wolper (Liege)
9:00 - 10:00 Invited lecture: On the Inherent Power of Bounded Cooperative
Concurrency, David Harel (The Weizmann Institute of Science, Rehovot, Israel)
10:00 - 10:30 Graphical versus Logical Specifications, G. Boudol (INRIA,
Sophia- Antipolis, France) and K.G. Larsen (Aalborg U., Denmark)
11:00 - 11:30 Towards the Unification of Models for Concurrency, G.L. Ferrari
and U. Montanari (U. di Pisa, Italy)
11:30 - 12:00 On Linear Logic and Petri Nets, U. Engberg and G. Winskel
(Aarhus U., Denmark)
Fourth ESOP session: chairman: Flemming Nielson (Aarhus)
12:00 - 12:30 On the Weak Adequacy of Branching-Time Temporal Logic, Ph.
Schnoebelen and S. Pinchinat (Laboratoire d'Informatique Fondamentale et
d'Intelligence Artificielle, IMAG, Grenoble, France)
Third CAAP session (parallel session): chairman: J. Diaz (Barcelona)
13:30 - 14:00 Probabilistic Analysis of some Distributed Algorithms, G.
Louchard (U. Libre de Bruxelles) and R. Schott (C.R.I.N., U. Nancy I, France)
14:00 - 14:30 Unitary Monoid with Two Generators: An Algorithmic Point of
View, M. Crochemore (U. Paris VII) and J. Neraud (U. de Rouen, France)
14:30 - 15:00 More Efficient Bottom-up Tree Pattern Matching with Application
to Semantic Analysis, J. Cai, R. Paige (Courant Institute, NY U.) and R.
Tarjan (Princeton U. and AT&T).
Fourth ESOP session continued (parallel session)
13:30 - 14:00 Resolution and Type Theory, L. Helmink (Philips Research
Laboratories, Eindhoven)
14:00 - 14:30 A Theory for Programming in Constructive Logic, A.A. Voronkov
(Institute of Mathematics, Novosibirsk)
14:30 - 15:00 Development of Concurrent Systems by Incremental
Transformation, E.P. Gribomont (Philips Research Laboratory, Bruxelles)
Fifth ESOP session: chairman: T. Reps (Madison, Wisconsin)
15:30 - 16:00 The Specificity Rule for Lazy Pattern-Matching in Ambiguous
Term Rewrite Systems, R. Kennaway (U.of East Anglia, Norwich, U.K.)
16:00 - 16:30 Graph-based Implementation of a Functional Logic Language, H.
Kuchen, Rita Loogen, (RWTH, Aachen), J.J. Moreno-Navarro (U. Politecnica de
Madrid) and M. Rodriguez-Artalejo (U. Complutense de Madrid)
16:30 - 17:00 On the Expressive Power of Programming Languages, M. Felleisen
(Rice U., Houston, Texas)
THURSDAY, MAY 17, 1990
Sixth ESOP session: chairman: Bernard Lang (Paris)
9:00 - 10:00 Invited lecture: Transformational Derivation of Nonnumerical
Finite Differencing Algorithms, Robert Paige (Courant Institute, NY U.)
10:00 - 10:30 Synthesis of Eureka Predicates for Developing Logic Programs,
M. Proietti (IAC-CNR, Rome) and A. Pettorossi (U. of Rome Tor Vergata)
11:00 - 11:30 Eureka Definitions for Free!, H. R. Nielson and Fl. Nielson
(Aarhus U., Denmark)
11:30 - 12:00 A Syntactic Theory of Transparent Parameterization, S.
Jefferson, S-D. Lee and D. P. Friedman (Indiana U., Bloomington)
12:00 - 12:30 The Value Flow Graph: A Program Representation for Optimal
Program Transformations, B. Steffen (U. of Edinburgh), J. Knoop and O.
Ruething (Christian- Albrechts-U., Kiel)
Fourth CAAP session: chairman: Sven Skyum (Aarhus)
13:30 - 14:00 Infinite Values in Hierarchical Imperative Types, M.I.
Schwartzbach (Aarhus U., Denmark)
14:00 - 14:30 Coherence of Subsumption, P.-L. Curien (LIENS, Paris) and G.
Ghelli (U. di Pisa, Italy)
14:30 - 15:00 ML Typability is Dexptime-Complete, A.J. Kfoury (Boston U.), J.
Tiuryn and P. Urzyczyn (U. of Warsaw)
Friday, May 18, 1990
Fifth CAAP session: chairman: G. Longo (Pisa)
9:00 - 10:00 Invited lecture: Trees Everywhere, Xavier Gerard Viennot (U.
Bordeaux I)
10:00 - 10:30 Graph Matching in Operational Semantics and Typing, K.H. Holm
(DIKU, Copenhagen)
11:00 - 11:30 Combinatory Forms for Equational Programming: Instances,
Unification and Narrowing, M. Bellia (U. di Napoli and U. di Pisa, Italy), M.
Bugliesi (Enidata S.p.A., Bologna) and M.E. Occhiuto (U. di Pisa)
11:30 - 12:00 Testing for Inductive (Co)-Reducibility, E. Kounalis (C.R.I.N.,
U. Nancy I, France)
12:00 - 12:30 About the Regular Structure of Prefix Rewritings, D. Caucal
(IRISA, Rennes, France)
Seventh ESOP session: chairman: Chris Hankin (London)
13:30 - 14:00 A Backwards Analysis for Compile-time Garbage Collection, Th.P.
Jensen and T.Ae. Mogensen (DIKU, Copenhagen)
14:00 - 14:30 Higher Order Escape Analysis: Optimizing Stack Allocation in
Functional Program Implementations, B. Goldberg and Y.G. Park, (Courant
Institute, NY U.)
14:30 - 15:00 Complexity Analysis for a Lazy Higher Order Language, D. Sands
(Imperial College, London)
15:00 - 15:30 Algebraic Properties of Program Integration, T. Reps (U. of
Wisconsin, Madison)
ORGANISATION
Program Committee CAAP '90:
Andre Arnold (Bordeaux, chairman), G. Ausiello (Rome), Franz J. Brandenburg
(Passau), B. Courcelle (Bordeaux), Max Dauchet (Lille), J. Diaz (Barcelona),
Hartmut Ehrig (Berlin West), Joost Engelfriet (Leiden), G. File (Padova),
David Harel (Rehovot), M. Jantzen (Hamburg), G. Longo (Pisa), Maurice Nivat
(Paris), Sven Skyum (Aarhus), P. Wolper (Liege)
Program Committee ESOP '90:
Neil D. Jones (Copenhagen, chairman), Guy Cousineau (Paris), Harald Ganzinger
(Dortmund), Chris Hankin (London), Bernard Lang (Paris), Pierre Lescanne
(Nancy), Bernd Mahr (Berlin West), Tom Maibaum (London), Jan Maluszynski
(Linkoeping), Peter Mosses (Aarhus), Bengt Nordstroem (Goeteborg), Philip
Wadler (Glasgow), Reinhard Wilhelm (Saarbruecken), Glynn Winskel (Aarhus)
Local Arrangements:
Nils Andersen (Copenhagen, chairman), Klaus Grue (Copenhagen), Lars Ole
Andersen (Copenhagen)
We thank Max Dauchet for organizing the Program Committees' meeting in Lille,
France.
SYSTEMS DEMONSTRATIONS
Non-commercial software systems will be demonstrated in parallel with the
conference. Systems of interest include but are not restricted to
programming environments and tools, prototyping systems, term rewriting
systems, theorem provers, unusual compilers, program transformation systems
and partial evaluators.
Proposals that meet the above definition are welcomed.
If you are interested, please send a one page tool description with related
paper, if any, as well as the necessary hardware and software running
conditions to the local arrangements chairman. The available equipment
includes Sun 3, Sun 4, Vax, PC and Macintosh.
EXCURSION
Kronborg Castle Tour and Conference Dinner
The Conference excursion (to Kronborg Castle, Elsinore) and banquet take
place on Thursday afternoon and evening. Participation in the excursion is
not included in the conference fee but must be reserved and paid separately.
The price is DKK 450, which must be included in the grand total accompanying
the registration form. Written cancellations before May 10 are refunded in
full. There is no refund in case of later cancellation. Only a limited
number of places are available.
GENERAL INFORMATION
Proceedings
The proceedings will be published by Springer-Verlag in two separate volumes
(in the series Lecture Notes in Computer Science) and handed out to
registered participants. The journal Theoretical Computer Science will
dedicate two issues to the best papers.
Location and dates
The conference will be held on May 15-18, 1990, at the Hans Christian Oersted
Institute, which houses the mathematical, physical, and chemical departments
of the University of Copenhagen. The conference area is situated in the
science campus of the University, near Faelledparken. The address is
Universitetsparken 5, DK-2100 Copenhagen Oe, and the site may be reached from
Noerreport Station in 11 minutes with buses number 43, 173E, or 184. There
are trains every few minutes from the central railway station to Noerreport
Station (travel time: 3 minutes).
CONFERENCE HOTELS
The prices are per room (single or double) per night, breakfast included.
The exact prices are printed on the registration form.
High class hotel (price range DKK 1200 - 900):
Hotel Imperial, Vester Farimagsgade 6
DK-1606 Copenhagen V
Middle class hotels (price range DKK 900 - 600):
Grand Hotel, Vesterbrogade 9
DK-1620 Copenhagen V
Ladbroke Komfort Hotel, Loengangstraede 27
DK-1468 Copenhagen K
Economy class hotel (price range DKK 600 - 300)
Ibsens Hotel, Vendersgade 23
DK-1363 Copenhagen K
The grand total must include a hotel deposit for the first night. The
deposit will be deducted when the bill is finally settled with the hotel.
For registrations and deposits received after April 1, 1990, rooms at the
Conference Hotels cannot be guaranteed.
OTHER ACCOMMODATION
Information about other possibilities may be obtained from the conference
bureau: Spadille Congress Service, Sommervej 3, DK-3100 Hornbaek, Denmark.
Rooms in private homes may be rented at a counter at Hovedbaneg!rden (the
central railway station, where the airport bus arrives).
REGISTRATION FEE
Before April 1, 1990, the registration fee is DKK 1700 (payment must be
received by Spadille Congress Service). The registration fee also covers
lunches, daily refreshments, and a set of the conference proceedings.
For late registration, after April 1, 1990, the conference fee is DKK 2100.
Students may register for DKK 1200. Students' fee does not cover lunches or
proceedings.
REGISTRATION FORM AND PAYMENT
Registration Form accompanied by payment must be returned to the Congress
Bureau: Spadille Congress Service, Sommervej 3, DK-3100 Hornbaek, Denmark,
before April 1, 1990.
Cheques and payment orders should be made out in Danish crowns (DKK).
Personal cheques drawn on non-Danish banks cannot be accepted, nor can
Eurocheques or credit cards.
Each participant will receive a written confirmation of registration from
Spadille Congress Service upon payment of the grand total.
Cancellations
In case of cancellation received by Spadille Congress Service before April 1,
1990, the registration fee will be refunded after deduction of a handling
charge of DKK 50. Before May 10, 1990, the registrant will be entitled to a
50% refund after the congress. Any hotel deposit will be fully returned.
After May 10, 1990, no refunds will be made of registration fee or hotel
deposit.
Registration
Registration will take place at the H.C. Oersted Institute. Spadille
Congress Service will operate (in the lobby) at the following hours: Tuesday,
May 15, 1990: 08:00 - 17:00
Languages
The working language will be English. There will be no simultaneous
translation to other languages.
INFORMATION AND SECRETARIAT
Registration form and other information may be obtained from:
CAAP-ESOP-90 c/o Nils Andersen
DIKU, University of Copenhagen, Universitetsparken 1
DK-2100 Copenhagen O, Denmark
Telephone: +45 31 39 62 96 extension 412
Fax: +45 31 39 02 21
E-mail: nils@diku.dk
∂31-Jan-90 1532 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 6 February, 7:30 p.m.
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 15:32:44 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA14291; Wed, 31 Jan 90 15:12:49 PST
Date: Wed, 31 Jan 90 15:12:49 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9001312312.AA14291@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Syntax Workshop, Tuesday, 6 February, 7:30 p.m.
SYNTAX WORKSHOP
A Constructional Approach to (Some Types of) Coordination
Arnold Zwicky
Departments of Linguistics
Ohio State University and Stanford University
(zwicky@csli.stanford.edu)
Tuesday, 6 February, 7:30 p.m.
Cordura 100
Given the assumptions that conjuncts are constituents and of the same
category, and that material shared in coordination is syntactically
identical in its construal with each conjunct, coordination has been
appealed to decide the following questions: whether a subexpression
constitutes a single syntactic constituent; whether two constituents
belong to the same category; whether two occurrences of some
phonological material involve the same lexemes; and whether two
occurrences of a lexeme involve the same inflectional forms of it.
The resulting answers tend towards the paradoxical: JAMIE TEN DOLLARS
must be a constituent in (1),
(1) WE GAVE JAMIE TEN DOLLARS AND JESS TWENTY DOLLARS
despite the contrary evidence of WH questions; AN ORPHAN and WARY OF
FAMILY GATHERINGS in (2)
(2) PAT IS AN ORPHAN AND WARY OF FAMILY GATHERINGS
must belong to the same syntactic category, as must APPROACHED and
WALKED ACROSS in (3);
(3) WE APPROACHED AND WALKED ACROSS THE CHASM
there must be several distinct dummy IT lexemes and several distinct
infinitive TO lexemes, given examples like (4) and (5);
(4) *IT RAINED LAST NIGHT AND SURPRISED ME THAT THE ROADS WERE DRY
(5) *WE MISTAKENLY EXPECTED AND THEN PERSUADED RONNIE TO BE A SPY
and German must have two distinct Dative cases, one for direct objects
and one for indirect objects, given examples like (6).
(6) *WIR GEBEN UND HELFEN DER KIRCHE.
"We give to and help the church."
The first step towards a clearer understanding of what is going on
here is to realize that "coordination" (like "complementation") is a
cover term for a large number of different, and different types of,
constructions, each with its own characteristic requirements on
conjuncts and on the material they share. What coordination
constructions share is two requirements, the first of which is common
to all constructions, the second common to "parallel" constructions of
all kinds; (A) each unit in a sentence must be assignable a single
coherent semantic interpretation; (B) material shared with parallel
units must satisfy all the relevant syntactic requirements with
respect to each of these units. Coordination constructions differ on
a number of dimensions, including whether they are
"loose-construction" (with conjuncts typically set off prosodically
from one another) or "close-construction" combinations, and whether
they involve focused material (as NEITHER ... NOR and BOTH ... AND
coordinations do) or not. The second step is to shift our attention
from the REPRESENTATIONS for sentences to the RULES that license those
representations by placing requirements on the constructions in them.
My concern here is with "ordinary" (close-construction nonfocus)
coordination. The idea is to take quite literally the notion that
conjuncts play parallel syntactic roles. I propose that in such
coordination, conjuncts must be licensed, BY THE SAME RULES, as
contiguous material representing, part by part, the same grammatical
relations with respect to these rules. Different chunkings into
conjuncts are thereby allowed: WILL YOU OR WON'T YOU DANCE? as well as
CAN KIM SING OR DANA DANCE?, (1) as well as WE HANDED JAMIE AND MAILED
JESS TEN DOLLARS; but the contiguity requirement disallows examples
like *CAN KIM SING OR WILL DANCE? and *WE SENT JAMIE TEN DOLLARS AND
HANDED TWENTY DOLLARS, unless there is a rule of ellipsis, like
Gapping, that specifically licenses them. Rules with modest
requirements on what can serve in a particular grammatical relation
will allow cross-categorial coordination, as in (2) and (3). But even
the same forms of the same lexemes will not necessarily be licensed,
since everything will depend on which rule licenses them; similar
material licensed by distinct rules is what prohibits (4), (5), and
(6).
I am advancing here a program, rather than a theory. Much depends on
how constructions, and hence the rules describing them, are to be
individuated in a language. (Insofar as the same-rule requirement is
supported by a variety of clear data, it could then be used to shed
light on constructional identity and distinctness.) My aim is to make
this program plausible as a strategy for circumventing many of the
difficulties that beset current representation-based approaches to
coordination.
The next workshop will be Tuesday, 20 February.
∂31-Jan-90 1638 keyes@sierra.STANFORD.EDU An Invitation to meet the VISITING COMMITTEE
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 16:38:34 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Wed, 31 Jan 90 16:34:18 PST
Date: Wed, 31 Jan 90 16:34:18 PST
From: keyes@sierra.STANFORD.EDU (Gloria L. Keyes)
To: ee-faculty@sierra.STANFORD.EDU
Cc: ee-adminlist@sierra.STANFORD.EDU
Subject: An Invitation to meet the VISITING COMMITTEE
Message-Id: <CMM.0.88.633832451.keyes@>
A VISITING COMMITTEE of prominent university and industry people from
around the country will convene at Stanford for an all day meeting on
WEDNESDAY, FEBRUARY 7, for the purpose of assessing the department and
its programs.
At the conclusion of the meeting, there will be a cocktail hour to which
you are cordially invited. It will be at the Faculty Club, Red Lounge,
Feb. 7, from 5:00 to 6:00 PM.
Please RSVP by Friday, 2/2, to Keyes@sierra.
Thank you,
Gloria
∂31-Jan-90 1650 @Neon.Stanford.EDU,@Polya.Stanford.EDU:THEORYNT@VM1.NoDak.EDU workshop on algorithmic research in the midsouthwest
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 Jan 90 16:50:41 PST
Received: from Polya.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22413; Wed, 31 Jan 90 16:50:15 -0800
Received: from vm1.NoDak.edu by Polya.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14491; Wed, 31 Jan 90 16:45:51 -0800
Message-Id: <9002010045.AA14491@Polya.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4776; Wed, 31 Jan 90 18:44:31 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4762; Wed, 31 Jan 90 18:44:26 CST
Date: Wed, 31 Jan 90 18:43:05 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Arkady Kanevsky <arkady@helois.tamu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Arkady Kanevsky <arkady%helois.tamu.edu@VM1.NoDak.EDU>
Subject: workshop on algorithmic research in the midsouthwest
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
WARM
Workshop on Algorithmic Research in the Midsouthwest
The University of Texas, Austin
Knopf Room * Flawn Academic Center * Fourth Floor
Friday, March 23, 1989
9:30--10:00 am Coffee
10:00--10:45 am Talk 1
Hal Sudborough, University of Texas at Dallas
``Embedding Large Mesh Networks into Small Ones''
11:00--11:45 Talk 2
Mark W. Krentel, Rice University
``The Complexity of Local Search''
12:00--1:30 pm Lunch * The Atrium, Flawn Academic Center
1:30--2:00 pm Business meeting
2:00--2:45 pm Talk 3
Jianer Chen, Texas A & M University
``Distributional Properties of Graph Imbeddings on
Topological Surfaces,''
3:00--3:30 pm Coffee break
3:30--4:15 pm Talk 4
Sukhamay Kundu, Louisiana State University
``Minimum State Non-Deterministic Finite-State Machines''
4:30 pm Adjourn to Burdine Hall, Room 214, for individual discussions
6:30 pm Dinner * Informal dinner to be arranged at local restaurant
***************************************************************
For more information, contact Nancy Lawler, Department of Computer Sciences,
The University of Texas at Austin, Austin, Texas 78712 (nel@cs.utexas.edu,
(512) 471-9547).
For further information on the technical program, contact Vijaya Ramachandran,
Department of Computer Sciences, The University of Texas at Austin,
Austin, Texas 78712 (vlr@cs.utexas.edu, (512) 471-9554).
Abstracts of Talks are Attached
``Embedding Large Mesh Networks into Small Ones''
Hal Sudborough
The University of Texas at Dallas
The talk describes previous results on mesh embeddings by Aleliunas and
Rosenberg, Ellis, and others. Earlier work has shown that rectangular mesh
networks can be embedded by a one-to-one map into either the smallest, or
next-to-smallest square mesh, with enough processors, with dilation at most
three. Furthermore, Fiat and Shamir described a new architecture, which they
called a "polymorphic array", which can host arbitrarily large meshes with an
even, or nearly even, number of mesh points mapped to each polymorphic array
processor. Our results extend the embeddings of Aleliunas, Rosenberg, Ellis,
and others, to many-to-one mappings of large meshes into small ones. We
describe embeddings of large meshes into small ones with dilation 1 in such a
way that each host mesh processor receives at most one more than the required
number of guest mesh processes. This suggests that classic meshes perform as
well as polymorphic arrays under appropriate assignments.
``The Complexity of Local Search''
Mark W. Krentel
Rice University
A popular method of solving difficult combinatorial problems is through local
search. Although these methods seem to converge after only a few iterations
in practice, very little is known about them theoretically, or more generally,
about the complexity of finding locally optimal solutions. Johnson,
Papadimitriou and Yannakakis formalized the question of finding local optima
by defining the class PLS (Polynomial-Time Local Search). In this talk, we
will discuss PLS-completeness and its significance to local search algorithms
and NP-completeness. For example, GRAPH PARTITIONING and TRAVELING SALESMAN
are PLS-complete, and for these problems there are instances for which any
local improvement algorithm will take exponentially many iterations.
``Distributional Properties of Graph Imbeddings on Topological Surfaces''
Jianer Chen
Texas A & M University
We study the distributional properties of graph imbeddings on topological
surfaces. In particular, we study the ``average genus'' of graphs. Our
main results are as follows:
* With only finite exceptions, a graph of average genus less
than 1 must be a necklace. We also list all those exceptional
graphs.
* The average genus of a 3-regular graph is at least half the
maximum genus.
* No real number can be limit points of values of the average
genus of 3-connected 3-regular graphs.
* There are infinitely many real numbers that are limit points of
the values of the average genus of 2-connected graphs.
Some algorithmic issues in topological graph theory are also mentioned.
``Minimum State Non-Deterministic Finite-State Machines''
Sukhamay Kundu
Louisiana State University
We present here a canonical non-deterministic finite-state machine for a
regular language L. We then obtain the optimal (smallest number of states)
non-deterministic machine for $L$ by merging certain states of the canonical
machine based on a suitably defined partial ordering of the states. This is
unlike the case of the minimum deterministic form of a machine for L which is
obtained by merging states based on an equivalence relationship. The
optimal non-deterministic machine for a regular language L may have
exponentially fewer number of states compared to that of the optimal
deterministic machine for L. Also, the optimal non-deterministic machine
for L has the same number of states as that for the reverse language
{Lr=x sup r : x in L} although the number of states in the optimal
deterministic machine for L may be exponentially large (or small) compared to
that for Lr. The optimal non-deterministic form is shown to be unique under
some mild "saturation" condition.
∂01-Feb-90 0958 LOGMTC-mailer MSRI seminars for Feb. 5 - 9 1990
Received: from msri.org (pascal.msri.org) by SAIL.Stanford.EDU with TCP; 1 Feb 90 09:58:30 PST
Received: by msri.org (AIX 2.1.2/s2.2)
id AA26094; Thu, 1 Feb 90 09:51:24 PST
Date: Thu, 1 Feb 90 09:51:24 PST
From: abaxter@msri.org (Arlene Baxter)
Message-Id: <9002011751.AA26094@msri.org>
To: weekly@msri.org
Subject: MSRI seminars for Feb. 5 - 9 1990
Cc: abaxter@msri.org
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Seminar Announcements for the period
February 5 - 9, 1990
Monday, February 5
RECURSION THEORY 11:00 60 MSRI Seminar Room
D. Kaddah "High anti-cupping"
MSRI-EVANS MONDAY LECTURE 4:15 60 Evans Hall
R. Shore "On the strength of Konig's duality theorem for infinite bipartite graphs"
Tuesday, February 6
ALGEBRAIC TOPOLOGY 10:00 MSRI Lecture Hall
S. Sawin "Conformal field theory from scratch"
MODEL THEORY 1:00 MSRI Seminar Room
J. Loveys "Geometric Stability Theory" (II)
ALGEBRAIC K-THEORY 2:00 MSRI Seminar Room
T. Goodwillie "Introduction to algebraic K-theory"
SET THEORY 3:30 MSRI Lecture Hall
S. Friedman "Fine structure for L and core models" (Continued)
Wednesay, February 7
RECURSION THEORY 3:30 MSRI Lecture Hall
D. Cenzer " - classes" (II)
Thursday, February 8
ALGEBRAIC TOPOLOGY 9:30 MSRI Lecture Hall
S. Sawin "Conformal field theory from scratch" (II)
CROSS-CULTURAL SEMINAR 11:00 MSRI Lecture Hall
G. Cherlin "Totally categorical theories" (IV)
CENTER FOR PURE & APPLIED MATHEMATICS LUNCH TALK 12:10 (Bring your lunch)
L. Zadeh "Fuzzy logic and its applications" 12:45 Faculty Club Conf. Rm.
MODEL THEORY 1:00 MSRI Seminar Room
J. Loveys "Geometric Stability Theory" (III)
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
E. Trubowitz "The distribution of lattice points and the spectrum of a periodic Schrodinger operator"
Friday, February 9
AREA III SEMINAR 11:00 MSRI Seminar Room
R. Donagi "Moduli of vector bundles"
∂01-Feb-90 1111 @RELAY.CS.NET:mazzetti@ed.aaai.org
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 1 Feb 90 11:11:36 PST
Received: from relay2.cs.net by RELAY.CS.NET id ad14445; 1 Feb 90 13:11 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa02129; 1 Feb 90 14:08 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA17514; Thu, 1 Feb 90 10:55:30 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA20174; Thu, 1 Feb 90 11:01:40 PST
Date: Thu, 1 Feb 90 11:01:40 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9002011901.AA20174@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Cc: mazzetti@nilsson, taglio@nilsson
History of AI -after 1970-Video
Last fall, I asked the council and past presidents if anyone would be
interested in helping with a timeline of the history of AI after 1970
which would be used as part of poster. Several of you agreed to assist
me in this effort. Well, that project died because of the cost and time
constraints.
Recently, I met with some DEC folks about creating a video of this same
project which would be presented during the opening reception of AAAI-90.
The video would be playing in the background while people munched and drank.
The purpose of the video is to act as a catalyst for conversation rather than
some overbearing commercial presentation.
Before I proceed any further, I need first your opinion on the value of this
history project. I personally think it would be quite valuable because it can
serve many purposes. It not only identify major theoretical achievements and
technological developments, but also be used as an educational tool for
high school students.
I also need your opinion about the video presentation during the reception.
Do you like the idea? Please remember that all editorial control about the
history is in our hands; DEC would simply produce and pay for it. We would
review any script.
Lastly, if you agree with this project and its use during the reception, I would
like to hear from you because we need to proceed with this project quickly.
Cheers, Claudia
PS: For those who have not responded to the message about the continuation
of the prize paper award, please forward your comments soon.
∂01-Feb-90 1311 @Sunburn.Stanford.EDU:nakata@jessica.Stanford.EDU Portia status
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Feb 90 13:11:21 PST
Received: from Jessica.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25458; Thu, 1 Feb 90 13:07:35 -0800
Received: from LOCALHOST by jessica.Stanford.EDU (5.59/25-eef) id AA26112; Thu, 1 Feb 90 13:07:51 PDT
Message-Id: <9002012107.AA26112@jessica.Stanford.EDU>
To: ben@psych.Stanford.EDU, daniel@mojave.Stanford.EDU,
david@playfair.Stanford.EDU, der@psych.Stanford.EDU,
eaf@sumex-aim.Stanford.EDU, f.futures@macbeth.Stanford.EDU,
heck@sunburn.Stanford.EDU, hitt@neon.Stanford.EDU,
instructors@sunburn.Stanford.EDU, jones@sunburn.Stanford.EDU,
linton@interviews.Stanford.EDU, martin@playfair.Stanford.EDU,
maydan@cs.Stanford.EDU, mcgrory@sunburn.Stanford.EDU,
meng@tilden.Stanford.EDU, mvj@playfair.Stanford.EDU,
nakata@jessica.Stanford.EDU, n.nutrasweet@macbeth.Stanford.EDU,
nick@sunburn.Stanford.EDU, seligman@farlow.Stanford.EDU,
sohie@neon.Stanford.EDU, ullman@cs.Stanford.EDU,
art@playfair.Stanford.EDU, flail@portia.Stanford.EDU,
roland@neon.Stanford.EDU, brinck@neon.Stanford.EDU
Cc: randy@jessica.Stanford.EDU, alderson@jessica.Stanford.EDU,
dennis@jessica.Stanford.EDU
Subject: Portia status
Date: Thu, 01 Feb 90 13:07:49 -0800
From: Lance Nakata <nakata@jessica.Stanford.EDU>
Portia is down again (Thurday, 1pm), and it took much persistence on our
part to get DEC field service out here. Right now, there is a
technician trying to diagnose the problem. Unfortunately, we have no
estimate on the uptime.
Apologies to those of you who already saw parts of what follows, but I
wanted to make sure everyone was aware of this weekend's downtime.
=====
Well when it rains, it pours. The Operations & Maintenance Work Control
Center has dropped a last minute bomb on us. They intend to shut down
chilled water cooling this weekend, so Portia will be down from midnight
Friday to midnight Sunday. We will stand watch and bring Portia up
sooner if chilled water returns ahead of schedule. Macbeth generates
much less heat, so we will try to keep it running (though it might also
be shut down if it's too hot).
After all of Portia's thrashing and crashing, we hate to have this
downtime happen now. But hopefully the kernel changes Dennis Michael
made on Portia will make it more stable in the future.
I realize there are course assignments going out Friday, but I'm afraid
little work will get done on them this weekend.
=====
It's pretty obvious that the kernel changes didn't solve the latest
problem, which could be totally seperate from previous ones. We'll try
to keep you all informed. As always, feel free to repost this to other
appropriate forums.
Lance Nakata
Academic Information Resources
∂01-Feb-90 1503 swartout@vaxa.isi.edu
Received: from vaxa.isi.edu by SAIL.Stanford.EDU with TCP; 1 Feb 90 15:03:38 PST
Posted-Date: Thu 1 Feb 90 15:00:54-PST
Received: by vaxa.isi.edu (5.61/5.61)
id AA08973; Thu, 1 Feb 90 15:00:56 -0800
Date: Thu 1 Feb 90 15:00:54-PST
From: Bill Swartout <SWARTOUT@VAXA.ISI.EDU>
To: mazzetti@ed.aaai.org
Cc: FEIGENBAUM@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, BUCHANAN@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, ENGELMORE@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM,
hector%ai.toronto.edu@RELAY.CS.NET, hes@scrc-vallecito.symbolics.com,
marty@cis.s, mazzetti@nilsson, taglio@nilsson
Message-Id: <633913254.0.SWARTOUT@VAXA.ISI.EDU>
In-Reply-To: <9002011901.AA20174@nilsson.aaai.org>
Mail-System-Version: <VAX-MM(217)+TOPSLIB(128)@VAXA.ISI.EDU>
I like the idea of a video history, but I'm not sure that the reception
is the best place to play it. I mostly go the the reception to chat with
my friends. It might be better to have it running continuously at the
exhibits.
-Bill
-------
∂01-Feb-90 1602 keyes@sierra.STANFORD.EDU Reminder of EE Faculty Meeting tomorrow, 2/2
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 1 Feb 90 16:02:30 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Thu, 1 Feb 90 15:54:58 PST
Date: Thu, 1 Feb 90 15:54:58 PST
From: keyes@sierra.STANFORD.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.STANFORD.EDU
Subject: Reminder of EE Faculty Meeting tomorrow, 2/2
Message-Id: <CMM.0.88.633916497.keyes@>
FACULTY MEETING
to discuss the results of the Quals
Friday, Feb. 2
3:15PM
McCullough Room 134
∂01-Feb-90 1655 bobrow@pooh.parc.xerox.com Time Line for AI
Received: from arisia.Xerox.COM by SAIL.Stanford.EDU with TCP; 1 Feb 90 16:55:38 PST
Received: from pooh.parc.Xerox.COM by arisia.Xerox.COM with SMTP
(5.61+/IDA-1.2.8/gandalf) id AA07480; Thu, 1 Feb 90 16:39:49 -0800
Received: from bullwinkle.parc.Xerox.COM by pooh.parc.xerox.com with SMTP
(5.61+/IDA-1.2.8/gandalf) id AA11700; Thu, 1 Feb 90 16:38:47 PST
Date: Thu, 1 Feb 90 16:34 PST
From: Danny Bobrow <bobrow@parc.xerox.com>
Subject: Time Line for AI
To: mazzetti@ed.aaai.org
Cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@parc.xerox.com, buchanan@vax.cs.pitt.edu, clancey.pa@Xerox.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM,
hector%ai.toronto.edu@RELAY.CS.NET, hes@scrc-vallecito.symbolics.com,
marty@cis.stanford.edu, mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu,
reddy@FAS.RI.CMU.EDU, swartout@VAXA.ISI.EDU, taglio@nilsson.ARPA
In-Reply-To: <9002011901.AA20174@nilsson.aaai.org>
Message-Id: <19900202003459.4.BOBROW@BULLWINKLE.parc.xerox.com>
I like the idea of the time line, and history. It is too easy to lose
track of the larger picture. We can use the original data to build not
only a script for a video, but perhaps a post, a hypertext linked
bibliography tied to the time-line, etc.
As for showing this at the reception, I think if it off in one corner
where viewing is voluntary (as it might also be at the show), then it
could be a useful focus for some interesting discussions. I don't
think it ought to be an "event" at the reception, where we all have to
stop and look at it, or leave the area.
danny
∂01-Feb-90 2347 @Sunburn.Stanford.EDU:nakata@jessica.Stanford.EDU Portia downtime slightly modified
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Feb 90 23:47:36 PST
Received: from Jessica.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13080; Thu, 1 Feb 90 23:47:28 -0800
Received: from LOCALHOST by jessica.Stanford.EDU (5.59/25-eef) id AA08018; Thu, 1 Feb 90 23:47:39 PDT
Message-Id: <9002020747.AA08018@jessica.Stanford.EDU>
To: ben@psych.Stanford.EDU, daniel@mojave.Stanford.EDU,
david@playfair.Stanford.EDU, der@psych.Stanford.EDU,
eaf@sumex-aim.Stanford.EDU, f.futures@macbeth.Stanford.EDU,
heck@sunburn.Stanford.EDU, hitt@neon.Stanford.EDU,
instructors@cs.Stanford.EDU, jones@sunburn.Stanford.EDU,
linton@interviews.Stanford.EDU, martin@playfair.Stanford.EDU,
maydan@cs.Stanford.EDU, mcgrory@sunburn.Stanford.EDU,
meng@tilden.Stanford.EDU, mvj@playfair.Stanford.EDU,
nakata@jessica.Stanford.EDU, n.nutrasweet@macbeth.Stanford.EDU,
nick@sunburn.Stanford.EDU, seligman@farlow.Stanford.EDU,
sohie@neon.Stanford.EDU, ullman@cs.Stanford.EDU,
art@playfair.Stanford.EDU, flail@portia.Stanford.EDU,
roland@neon.Stanford.EDU, brinck@neon.Stanford.EDU
Cc: randy@jessica.Stanford.EDU, alderson@jessica.Stanford.EDU,
dennis@jessica.Stanford.EDU, cs194@interviews.Stanford.EDU
Subject: Portia downtime slightly modified
Date: Thu, 01 Feb 90 23:47:37 -0800
From: Lance Nakata <nakata@jessica.Stanford.EDU>
After much discussion, we have decided to do our best to keep Portia
running without air conditioning this weekend (though it will still be
down for Saturday's usual 2am system backup). Keeping Portia up might
require us to keep someone in or near the machine room 24 hours a day in
case the ambient temperature rises to high levels. If heat threatens
hardware integrity, we may take Portia down with *very little notice*,
so please be prepared.
Some of Portia's recent crashes have been totally inexplicable, and both
we and DEC are extremely puzzled over this behavior. However, as a
result of all these crashes, many of us could not tolerate a
Stanford-induced downtime when Portia has been down so much already.
Hence, a handful of us will make a very concerted effort to keep things
running.
Please note that Portia may continue to crash at seemingly random times,
so it would be prudent to tell students to save their work often (and
perhaps occasionally copy it to other hosts). We're still trying to
figure out what's going on in this area and have even put DEC on notice
to find us a replacement machine if problems persist.
We may not always be able to staff our machine room for 24 hours during
cooling outages, but we feel it's very necessary this time. As always,
please feel free to forward this bulletin to appropriate forums.
Lance Nakata
Academic Information Resources
∂02-Feb-90 1147 stager@Sunburn.Stanford.EDU Preliminary Class Lists
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Feb 90 11:46:53 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA23641; Fri, 2 Feb 90 11:43:44 -0800
Date: Fri, 2 Feb 1990 11:43:43 PST
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: stager@Sunburn.Stanford.EDU
Subject: Preliminary Class Lists
Message-Id: <CMM.0.88.633987823.stager@Sunburn.Stanford.EDU>
Preliminary class lists have arrived, and will be delivered to your mail
boxes within the next few days.
IMPORTANT NOTE:
Please verify that the grading style listed under your name in the upper
left corner of the page is correct. Grading options will generally be of the
types:
"Optional +/NC", indicating that a letter grade will be assigned unless
student registers for the course "+/NC"
OR
"S/NC Only", indicating that the instructor will be assigning ONLY
"satisfactory' or "no credit" grades
Let me know if you have any questions.
Claire
∂02-Feb-90 1425 hemenway@Sunburn.Stanford.EDU Folders Ready
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Feb 90 14:24:57 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA00118; Fri, 2 Feb 90 14:25:25 -0800
Date: Fri, 2 Feb 1990 14:25:24 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Folders Ready
Message-Id: <CMM.0.88.633997524.hemenway@Sunburn.Stanford.EDU>
Batch 1 folders are ready and waiting to be picked up in MJH 251.
At the end of the day, I'll put any unclaimed bunches in the
box now sitting outside my office door.
Our having the files ready before 4:00 is, unfortunately, something
we will not be able to repeat once we are also entering ratings in
the same day -- sorry 'bout that!
Sharon
∂02-Feb-90 1457 chandler@Sunburn.Stanford.EDU CS Colloquium - 2/6/90
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Feb 90 14:57:39 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA02196; Fri, 2 Feb 90 14:54:05 -0800
Date: Fri, 2 Feb 1990 14:54:05 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: CS Colloquium - 2/6/90
Message-Id: <CMM.0.88.633999245.chandler@Sunburn.Stanford.EDU>
Please mark your calendars.....Tuesday, February 6 at 4:15. H. T. Kung from
CMU will be our CS Colloquium speaker.
∂02-Feb-90 1508 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU 1990 CSD Retreat
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Feb 90 15:07:54 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02987; Fri, 2 Feb 90 15:07:48 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA08357; Fri, 2 Feb 90 15:01:56 PST
Date: Fri, 2 Feb 90 15:01:56 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002022301.AA08357@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: 1990 CSD Retreat
Cc: gibbons@sierra.stanford.edu, kruger@sierra.stanford.edu
At the last CSD Div Dir meeting we noted that it's
time to plan for the 1990 CSD Retreat. After checking
the calendars of people at that meeting and noting
that there is some sentiment for avoiding the Memorial
Day weekend, we came up with the proposal to hold
the retreat during the weekend of Friday, May 4 (starting
late afternoon, including dinner, and an after-dinner
session), continuing thru Saturday, May 5 (technical
talks by all of us), and ending around noon on Sunday,
May 6 with additional talks and lunch.
I hope that these dates are ok with most of us. Please
mark calendars if you would like to attend. I'll ask
for rsvp's later. Also, I will appreciate any suggestions
for special topics that ought to be discussed (beyond
the technical talks).
Thanks, -Nils
∂02-Feb-90 1610 grundy@csli.Stanford.EDU The Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Feb 90 16:10:06 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA28212; Fri, 2 Feb 90 16:07:12 PST
Date: Fri 2 Feb 90 16:07:11-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: The Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <634003631.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, February 8, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Herbert Lindenburger
Topic: "Literary Theory and Symbolic Systems"
ABSTRACT
--------
This session will discuss Keats's poem "To Autumn" as a
means of demonstrating the relation of formal devices and
semantic meaning in poetry. We will look at features such
as metrics, syntax, and images in order to help formulate
ways of approaching what people call a poem's "meaning."
Reading the (short) poem in advance will be helpful, but not
necessary.
Following week, February 15:
John Lamping, Xerox PARC
"Why are Computer Programs so Complicated?"
-------
∂02-Feb-90 1627 gilberts@Sunburn.Stanford.EDU MJH Carpet Cleaning
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Feb 90 16:27:29 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA05572; Fri, 2 Feb 90 16:08:36 -0800
Date: Fri, 2 Feb 1990 16:08:35 PST
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Cc: Gilbertson@Sunburn.Stanford.EDU
Subject: MJH Carpet Cleaning
Message-Id: <CMM.0.88.634003715.gilberts@Sunburn.Stanford.EDU>
Beware.... The carpet cleaners will be coming to
Bldg 460 next Wed and Thurs evenings (and perhaps
Fri to finish), Feb 7 - 9. They will begin on
the fourth floor on Feb 7 at 4:30 and work their
way down during the next two evenings.
Please be prepared to move small furniture up and
out of the way during those evenings, and schedule
around the vacuum cleaners and shampoo operators.
Excuse the inconvenience, but it will be nice to
have our carpets spiffed up again.
Thank you.
∂03-Feb-90 0323 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU special issue of Algorithmica
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Feb 90 03:23:29 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24500; Sat, 3 Feb 90 03:23:20 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10924; Sat, 3 Feb 90 03:23:02 -0800
Message-Id: <9002031123.AA10924@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7109; Sat, 03 Feb 90 04:44:58 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7083; Sat, 03 Feb 90 04:44:56 CST
Date: Sat, 3 Feb 90 01:35:43 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Hal Gabow <hal@boulder.Colorado.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Hal Gabow <hal%boulder.Colorado.EDU@VM1.NoDak.EDU>
Subject: special issue of Algorithmica
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
ALGORITHMICA SPECIAL ISSUE
ON NETWORK FLOW ALGORITHMS
ALGORITHMICA is dedicating a special issue to network flow
algorithms, in recognition of traditional interest and
significant recent progress in this area. Authors should note
the benefits of publication in a special issue -- a collection
of high-quality related papers in one volume, plus a guarantee
of publication of accepted papers with minimal time delay.
The emphasis of the special issue is efficient flow algorithms.
This includes algorithms for traditional network flow and
generalizations to multicommodity flows, lossy flows, matching,
matroid flow problems; sensitivity analysis; network analysis
and synthesis; efficient solution of problems using network
flow. The model of computation may be sequential, parallel or
distributed; deterministic or probabilistic algorithms, etc. The
algorithms should be provably efficient.
All manuscripts will be promptly and carefully refereed.
High-quality manuscripts not accepted for the special issue
because of space limitations may be accepted for a regular issue
of Algorithmica, if the author desires.
Authors should send four copies of a manuscript to
Harold N. Gabow
Department of Computer Science
University of Colorado at Boulder
Campus Box 430
Boulder, Colorado 80309
by July 31, 1990. Manuscripts should be in a format consistent
with that described in any recent issue of ALGORITHMICA.
∂03-Feb-90 0324 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Monkeys are NP-complete
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Feb 90 03:23:55 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24506; Sat, 3 Feb 90 03:23:49 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10927; Sat, 3 Feb 90 03:23:44 -0800
Message-Id: <9002031123.AA10927@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7177; Sat, 03 Feb 90 04:45:25 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7144; Sat, 03 Feb 90 04:45:23 CST
Date: Sat, 3 Feb 90 01:35:56 CST
Reply-To: David Harel <harel%wisdom.weizmann.ac.il@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: David Harel <harel%wisdom.weizmann.ac.il@VM1.NoDak.EDU>
Subject: Monkeys are NP-complete
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Monkey puzzle is NP-complete: In response to the query of Anne Lomax on
TheoryNet, Feb. 1, 1990.
-----------------------------------------------------------------------
You are right -- I did not include a pointer to the proof in the
bibliographic notes of the Algorithmics book. The idea is inspired by
a discussion I had with Adi Shamir. The reduction is from 3-PARTITION,
which is NP-complete in the strong sense (see Garey and Johnson's book,
page 224). Given the 3m numbers, you prepare a set of cards for each,
that make it possible to tile the tiles in the set side by side only. So
if the number is, say, 17, there will be 17 cards that can only fit together
to form a line of length 17, but they have colors (or monkey halves) to
enable that line to be attached on either side to some other such line.
In addition, each line is colored on the top and bottom to enable attachment
to other such lines from above and below. Now, you prepare a set of m↑2-3m
tiles of a special kind, that enable ONLY a tiling of a rectangle of width
m-3 and heght m, whose left hand side can be attached to the ends of the
lines coming from the numbers. It can now be shown that these tiles can
cover an mxm square if and only if you can partition the 3m numbers into
m triplets, each summing to B. For one direction, if the numbers can be
partitioned so, then you would lay down m lines of tiles, each representing
the three numbers in the triplet, and each then being of total length B, and
the rest of the square would then be a rectangle as above, and tiled with
the extra tiles. Conversely, assume you have been able to make the mxm
square. Then, the fact that you have managed to lay down the (m-3)xm rectangle
means that the rest of the square is a rectangle too, and since each number
is between B/2 and B/4, there must be exactly three numbers per line,
hence you have your partition.
∂03-Feb-90 1043 rgsmith@SLCS.SLB.COM
Received: from SLCS.SLB.COM by SAIL.Stanford.EDU with TCP; 3 Feb 90 10:43:41 PST
Received: from topcat.SLCS.SLB.COM
by SLCS.SLB.COM (4.1/SLCS Mailhost 2.3)
id AA07645; Sat, 3 Feb 90 12:43:46 CST
Received: by topcat.SLCS.SLB.COM (4.1/SLCS Subsidiary 1.5)
id AA05360; Sat, 3 Feb 90 12:43:43 CST
Date: Sat, 3 Feb 90 12:43:43 CST
From: rgsmith@SLCS.SLB.COM
Message-Id: <9002031843.AA05360.rgsmith@topcat.SLCS.SLB.COM>
To: mazzetti%ed.aaai.org@RELAY.CS.NET
Cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU,
Lehnert%cs.umass.edu@RELAY.CS.NET, Nilsson@SCORE.STANFORD.EDU,
Rich@MCC.COM, bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU,
clancey.pa@XEROX.COM, duda%polya@SCORE.STANFORD.EDU,
engelmore@SUMEX-AIM.STANFORD.EDU, forbus@A.CS.UIUC.EDU,
hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes%scrc-vallecito.symbolics.com@RELAY.CS.NET,
marty%cis.stanford.edu@RELAY.CS.NET, mckeown@CS.COLUMBIA.EDU,
minsky%mc.lcs.mit.edu@RELAY.CS.NET, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU, mazzetti@nilsson, taglio@nilsson
Claudia:
Re the video history, I think it is a very good idea. I also agree with Danny
that it could usefully fit into the reception (with the caveat that we ensure
a suitably large screen, and viewing area).
Re prizes, I have little to add to the already very articulate arguments on
both sides. For me it is not a crucial issue, but on balance I believe that:
1. We should offer a single "best paper" prize---leaving the definition up to
the program committee. I would rather see one prize then multiple prizes both
to encourage the committee to consider the breadth of papers in the field and
to encourage the attendees to listen to work not necessarily in their own
subfield. If a single prize is offered, the program chairs may be able to
realistically work with the recipient to "ensure" a high quality presentation
(more likely "encourage" same). The presentation (perhaps an expanded version
of the submitted paper) could be given in the invited talks track.
2. This prize should be optional. I don't see the need to award a prize in a
year where the committee feels there is no particularly outstanding
submission.
Cheers,
Reid
∂03-Feb-90 1809 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Mayr here for summer
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Feb 90 18:09:01 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13943; Sat, 3 Feb 90 18:07:28 -0800
Received: by coraki.stanford.edu (4.1/25-eef) id AA19225; Sat, 3 Feb 90 18:07:37 PST
Message-Id: <9002040207.AA19225@coraki.stanford.edu>
To: faculty@cs.stanford.edu
Subject: Mayr here for summer
Date: 03 Feb 90 18:07:36 PST (Sat)
From: pratt@cs.Stanford.EDU
Ernst Mayr will be here for summer. If anyone knows of any summer
housing between mid-July and September please let him or me know.
-v
------- Forwarded Message
Date: 02 Feb 90 09:58 GMT+0100
From: Ernst Mayr <mayr%vax1.rz.uni-frankfurt.dbp.de@relay.cs.net>
To: pratt%cs.stanford.edu@relay.cs.net
Subject: Re: visiting Stanford
...
BTW, we have accommodation basically for the month of August. We are still
looking for opportunities for the second half of July and all of September.
We are two adults and two children (one girl three years old in July, and a
nine months old, also by then). We would be housesitting, or renting
something, even a house-swap (our house is here about 12 miles outside
Frankfurt) for the period of our stay in the US would be possible. At the
end of September we are somewhat flexible because we might be away for a
week or so.
If you know of somebody interested, have them get in touch with me. Also,
let others know, please, like Gio Wiederhold.
Thank you very much,
- -ernst
------- End of Forwarded Message
∂04-Feb-90 1607 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Maryland Theoretical Computer Science Day
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Feb 90 16:06:55 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25333; Sun, 4 Feb 90 16:06:39 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24303; Sun, 4 Feb 90 16:05:15 -0800
Message-Id: <9002050005.AA24303@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1344; Sun, 04 Feb 90 18:01:29 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1332; Sun, 04 Feb 90 18:01:25 CST
Date: Sun, 4 Feb 90 18:00:42 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
"Duncan A. Buell" <duncan@super.org>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: "Duncan A. Buell" <duncan%super.org@VM1.NoDak.EDU>
Subject: Maryland Theoretical Computer Science Day
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Maryland Theoretical Computer Science Day
Sponsored by the Supercomputing Research Center (SRC), in cooperation with
the University of Maryland Institute for Advanced Computer Studies (UMIACS).
To be held at the Center of Adult Education on the campus of the
University of Maryland at College Park.
Friday, March 30, 1990
--------------------------------------------------------------------------
9:30- 9:50 Refreshments
9:50-10:00 Greeting by Paul Schneck, Director of SRC
10:00-11:00 Towards More Realistic Models of Parallel Computers
Ashok Chandra, IBM
11:00-12:00 A New Proof of the Linearity of the Boyer-Moore
String Matching Algorithm
Richard Cole, Courant Institute
2:00- 3:00 Supertoroidal Networks: Degree Four Alternatives
to the 3-D Mesh
Richard Draper, SRC
3:00- 4:00 Parallel Restructuring and Evaluation of Expressions
Franco Preparata, University of Illinois
4:00- 5:00 Wine and cheese
--------------------------------------------------------------------------
For additional information contact Barbara George (301) 805-7350
or Chuck Fiduccia
(301) 805-7374
fiduccia@super.org
Supercomputing Research Center
17100 Science Drive
Bowie, Maryland 20715
∂04-Feb-90 1723 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU faculty
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Feb 90 17:22:52 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28082; Sun, 4 Feb 90 17:23:15 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA09426; Sun, 4 Feb 90 17:17:29 PST
Date: Sun, 4 Feb 90 17:17:29 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002050117.AA09426@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: faculty
As I count billets, the CSD has (after Don Knuth's retirement) 1.45
billets. I have not talked with the Dean lately about his opinions
about these billets (I'm sure he has some). Neither have we as a
faculty had any kind of discussion about how these billets ought to be
used. I would like to try at least to initiate a discussion on the
matter just in case a consensus can be found. Vaughan Pratt made a
fine suggestion. It is for all of us to try to compose a list of a
few people that we think would be truly outstanding and that we think
we would actually be able to attract to Stanford. Although we will all
probably have people on our individual lists from our own individual
specialty areas, the union of these lists ought to be pretty
representative of who is excellent and who is probably recruitable for
Stanford. Then, perhaps a representative group of us faculty (or all
of us together for that matter) could meet to see if we could reach a
consensus about ranking these people---regardless of field. (I like the
idea that Joe Goodman mentioned at the last faculty lunch, namely that
we pay special attention to those of our faculty who are young enough
to be here for several years and thus have a big stake in selecting
excellent colleagues.)
I'll ask Joyce to keep a folder of your suggestions. It will probably
be best to give them to her personally to avoid having a lot of names
floating around on the network.
-Nils
∂05-Feb-90 0728 chandler@Sunburn.Stanford.EDU H. T. Kung.....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 07:28:06 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10704; Mon, 5 Feb 90 07:27:50 -0800
Date: Mon, 5 Feb 1990 7:27:49 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: H. T. Kung.....
Message-Id: <CMM.0.88.634231669.chandler@Sunburn.Stanford.EDU>
will be here tomorrow. He will be at our faculty lunch, and will be giving
the CS colloquium at 4:15. He is available to meet with faculty/students
between 1:15 and 3:45. Please let me know if you would like to meet with him.
∂05-Feb-90 0755 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Turing 1990 Colloquium, 3-6 April 1990, Sussex University
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 07:55:01 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02876; Mon, 5 Feb 90 07:54:47 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10978; Mon, 5 Feb 90 07:50:48 -0800
Message-Id: <9002051550.AA10978@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6022; Mon, 05 Feb 90 09:44:53 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6000; Mon, 05 Feb 90 09:38:27 CST
Date: Mon, 5 Feb 90 09:33:42 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Aaron Sloman <mcsun!ukc!icdoc!syma!aarons@uunet.uu.net>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Aaron Sloman <mcsun!ukc!icdoc!syma!aarons%uunet.uu.net@VM1.NoDak.EDU>
Subject: Turing 1990 Colloquium, 3-6 April 1990, Sussex University
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
NB - please do NOT use "reply". Email responses should go to
turing@uk.ac.sussex.syma
-----------------------------------------------------------------------
TURING 1990 COLLOQUIUM
At the University of Sussex, Brighton, England
3rd - 6th April 1990
This Conference commemorates the 40th anniversary of the publication in Mind
of Alan Turing's influential paper "Computing Machinery and Intelligence".
It is hosted by the School of Cognitive and Computing Sciences at the
University of Sussex and held under the auspices of the Mind Association.
Additional support has been received from the Analysis Committee, the
Aristotelian Society, The British Logic Colloquium, The International Union
of History and Philosophy of Science, POPLOG, Philosophical Quarterly, and
the SERC Logic for IT Initiative.
The aim of the Conference is to draw together people working in Philosophy,
Logic, Computer Science, Artificial Intelligence, Cognitive Science and
related fields, in order to celebrate the intellectual and technological
developments which owe so much to Turing's seminal thought. Papers will be
presented on the following themes: Alan Turing and the emergence of
Artificial Intelligence, Logic and the Theory of Computation, The
Church-Turing Thesis, The Turing Test, Connectionism, Mind and Content,
Philosophy and Methodology of Artificial Intelligence and Cognitive Science.
Invited talks will be given by Paul Churchland, Joseph Ford, Robin Gandy,
Clark Glymour, Douglas Hofstadter, J.R. Lucas, Donald Michie, Christopher
Peacocke and Herbert Simon, while other prominent contributors include
Robert French (Indiana), Beatrice de Gelder (Tilburg), Andrew Hodges
(Oxford), Philip Pettit (ANU) and Aaron Sloman (Sussex).
Anyone wishing to attend this Conference should complete the enclosed form
and send it to Andy Clark, TURING Registrations, School of Cognitive and
Computing Sciences, University of Sussex, Brighton, BN1 9QH, England, U.K.,
enclosing a STERLING cheque or money order for the total amount payable,
made out to "Turing 1990". We regret that we cannot accept payment in other
currencies. The form should be returned not later than Thursday 1st March,
1990, after which an extra fee of #5.00 for late registration is payable and
accommodation cannot be guaranteed.
The conference will start at lunchtime on Tuesday 3rd April, 1990, and will
end on Friday 6th April after tea. Final details will be sent to registered
participants in February 1990.
Conference Organizing Committee
Andy Clark (Sussex University), David Holdcroft (Leeds University),
Peter Millican (Leeds University), Steve Torrance (Middlesex Polytechnic)
___________________________________________________________________________
PROGRAMME OF INVITED SPEAKERS
Paul CHURCHLAND (UCSD)
Title to be announced
Joseph FORD (Georgia)
CHAOS : ITS PAST, ITS PRESENT, BUT MOSTLY ITS FUTURE
Robin GANDY (Oxford)
HUMAN VERSUS MECHANICAL INTELLIGENCE
Clark GLYMOUR (Carnegie-Mellon)
COMPUTABILITY, CONCEPTUAL REVOLUTIONS AND THE LOGIC OF DISCOVERY
Douglas HOFSTADTER (Indiana)
Title to be announced
J.R. LUCAS (Oxford)
MINDS, MACHINES AND GODEL : A RETROSPECT
Donald MICHIE (Turing Institute)
MACHINE INTELLIGENCE - TURING AND AFTER
Christopher PEACOCKE (Oxford)
PHILOSOPHICAL AND PSYCHOLOGICAL THEORIES OF CONCEPTS
Herbert SIMON (Carnegie-Mellon)
MACHINE AS MIND
____________________________________________________________________________
REGISTRATION DOCUMENT : TURING 1990
NAME AND TITLE : __________________________________________________________
INSTITUTION : _____________________________________________________________
STATUS : ________________________________________________________________
ADDRESS : ________________________________________________________________
________________________________________________________________
POSTCODE : _________________ COUNTRY : ____________________________
Any special requirements (eg. diet, disability) : _________________________
I wish to register for the Turing 1990 Colloquium and enclose a Sterling
cheque or money order, payable to "Turing 1990", for the total amount
listed below :
Please ENTER AMOUNTS as appropriate.
1. Registration Fee: Mind Association Members #30.00 ..............
(Compulsory)
Full-time students #30.00 ..............
(enclose proof of status
- e.g. letter from tutor)
Academics (including
retired academics) #50.00 ..............
Non-Academics #80.00 ..............
Late Registration Fee #5.00 ..............
(payable after 1st March)
2. Full Board including all meals from Dinner #84.00 ..............
on Tuesday 3rd April to Lunch on Friday
6th April, except for Thursday evening
OR
All meals from Dinner on Tuesday 3rd April #33.00 ..............
to Lunch on Friday 6th April, except for
Thursday evening
3. Conference banquet in the Royal Pavilion, #25.00 ..............
Brighton on Thursday 5th April
OR
Dinner in the University on Thursday 5th April #6.00 ..............
4. Lunch on Tuesday 3rd April #6.00 ..............
5. Dinner on Friday 6th April #6.00 ..............
______________
TOTAL #
______________
Signed ________________________________ Date ______________________
Please return this form, with your cheque or money order (payable to "Turing
1990"), to:
Dr Andy Clark
Turing 90
Cognitive and Computing Sciences,
University of Sussex,
Falmer, Brighton, BN1 9QH,
England.
____________________________________________________________________________
∂05-Feb-90 0829 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU optimization problem relevant to boolean functions and set theory
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 08:29:40 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA03574; Mon, 5 Feb 90 08:29:41 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12066; Mon, 5 Feb 90 08:29:24 -0800
Message-Id: <9002051629.AA12066@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6110; Mon, 05 Feb 90 09:51:52 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6097; Mon, 05 Feb 90 09:39:02 CST
Date: Mon, 5 Feb 90 09:33:59 CST
Reply-To: Lawrence Detweiler <ld231782%ccncsu.ColoState.Edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Lawrence Detweiler <ld231782%ccncsu.ColoState.Edu@VM1.NoDak.EDU>
Subject: optimization problem relevant to boolean functions and set theory
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I'm interested in corresponding about the following research
that applies to set theory and optimization. (Pardon me if I
use nonstandard terms where standard ones apply.)
Suppose we have many sets that are to be combined in union to
yield some "resultant" set. Suppose further that we would
like to minimize the number of sets involved. In short, the
"minimum union problem" is to
Find the minimum union of sets that contains the resultant.
"Minimum" means that there are no unions of fewer sets that
contain the resultant (although perhaps some with the same
count). "Contains" means that the resultant is a subset (
either equivalent or not) of the union. (No sets contain
repeated elements.)
The problem has a wide variety of applications (named and
isolated here for this reason), for example logic circuit
design: it is the same problem as finding the minimum number
of prime implicants that cover all terms in the Quine-McCluskey
algorithm for boolean function optimization. That is, their
algorithm DOES NOT OPTIMIZE (in general) unless it addresses
this problem (some presentations gloss over it).
Another application is scheduling, where for example a good
time for a meeting must be found that is compatible with
everyone's schedules. There are surely many other
applications.
A greedy algorithm by itself is not enough to guarantee
optimization either (although it appears to give a good
approximation).
EXAMPLE: For a particularly striking example consider how to
optimize a stock quotation system where clients are informed
of price changes in all stocks they subscribe to. The stock
prices are sent in packets over relays. The relays are not
mutually exclusive in the clients they reach; that is, the
same client may be reached by any number of relays. Clients
note the stocks prices they subscribe to (if any) in packets
that pass them on the relay. The optimum solution dictates
how to inform everyone in the fewest packets and smallest
packet size.
SOLUTION: First, to minimize the number of packets, we
consider all clients who must be notified (those that
subscribe to stocks prices that have changed) which comprise
the resultant set. View each relay as a set that contains
only these subscribers (all others are excluded). Then find
the minimum union of relays that reach every affected client.
Since a packet will be sent on every chosen relay, it follows
that when chosen relays are minimized, packets are also.
Next, to minimize the size of the packets, we consider all
subscribers per stock. As before view each relay as a set
that contains only these subscribers. We find the minimum
union of chosen relays that reach all subscribers of that
stock (the resultant). The stock price is added to the
packet of every relay in the solution. After all stocks are
considered the packets are sent.
Note that either phase may be eliminated to find the fewest
packets only or smallest packet size only. This is the
striking nature of the example; the optimum solution involves
multiple minimum unions.
Set "maps" make a convenient notation for the problem, where
each place in a string indicates the presence or absence of
an element. For an illustration, suppose relays are denoted
by letters and clients by numbers; a global mapping might
look like this:
a ## # #
b ## #
c ## #
d # # #
123456
which shows, for example, the A relay reaches clients 1, 2,
4, and 6. Using maps, a union is even simpler to find than
numerical addition; for each place, by definition if an
element is in any set then it is also in the union. (Note
that the union of all relays reaches all clients.)
Suppose that clients 1, 3, and 6 are affected by price
changes in two stocks. Columns that correspond to the other
clients can be eliminated:
a # #
b ##
c #
136
where the D relay is eliminated because it reaches none of
these clients. The minimum union that reaches all clients is
A + B, so only these relays will be used.
Now maps are drawn for affected clients on a per stock basis.
Suppose clients 1 and 6 subscribe to the first stock.
Focusing only on chosen relays and these subscribers gives
a ##
b #
16
which shows that the minimum union involves only A, so the
price is placed in the packet for that relay. Now suppose
all (affected) clients subscribe to the second stock:
a # #
b ##
136
The minimum union requires the maximum of A + B so this
price is placed in both packets, completing the optimization.
Both stocks are sent in the A relay packet and the second
stock in only the B relay packet.
In general, for N sets there are 2↑N possible combinations of
sets. Thus an algorithm to solve (find the optimum for) the
minimum union problem in worst case polynomial time (of sets)
is probably not possible. However, close approximations in
polynomial time are possible with a surprisingly
straightforward approach (particularly in the C language).
Simple enhancements to the basic algorithm improve both the
solution and the time required to determine it. A sensible
algorithm for actual optimization is accessable as well.
Send email if interested.
∂05-Feb-90 1003 eisensee@sierra.STANFORD.EDU Solid State Seminar
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 10:03:46 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Mon, 5 Feb 90 09:58:29 PST
Date: Mon, 5 Feb 90 09:58:29 PST
From: eisensee@sierra.STANFORD.EDU (Sandra K. Eisensee)
To: ee-adminlist@sierra, ee-faculty@sierra, Iclabusers@glacier
Cc: cis-people@glacier
Subject: Solid State Seminar
Message-Id: <CMM.0.88.634240707.eisensee@>
SOLID STATE LAB SEMINAR
AKA EE 430
TIME: 4:00pm REFRESHMENTS
4:15pm TALK STARTS
PLACE: AEL 109
DATE: FEBRUARY 7, 1990
TORGNY GUSTAFSSON
RUTGERS UNIVERSITY
"STRUCTUAL STUDIES OF RECONSTRUCTED METAL AND SEMICONDUCTOR SURFACES
USING ION SCATTERING"
One of the most intriguing phenomena that occurs on a surface is
reconstruction, a change in the geometrical arrangement of surface and
near-surface atomic layers to a structure different from a simple
continuation of the bulk. Reconstruction is well known in semiconductor
physics, but metal surfaces were for a long time believed to be much less
susceptible to such rearrangements. In this talk I will review some recent
work from my laboratory, performed using medium energy ion scattering with
channeling and blocking, on the structure of several different
reconstructions on Au(110) and Cu(100), as well as discussing some of the
initial and unexpected ways that thin films grow on these surfaces.
∂05-Feb-90 1159 chandler@Sunburn.Stanford.EDU Forsythe Lectures
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 11:59:12 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20199; Mon, 5 Feb 90 11:33:56 -0800
Date: Mon, 5 Feb 1990 11:33:56 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: csd-list@cs.Stanford.EDU
Subject: Forsythe Lectures
Message-Id: <CMM.0.88.634246436.chandler@Sunburn.Stanford.EDU>
Richard P. Brent from the Australian National University will be at Stanford
on Monday and Tuesday, February 12 and 13, to deliver the annual Forsythe
Lectures. If anyone is interested in meeting with Professor Brent, I will be
happy to try and find some time on the schedule for you to visit with him.
Please let me know (1) if you are interested in seeing him and (2) what
date/time you are available.
∂05-Feb-90 1206 @Sunburn.Stanford.EDU:nakata@jessica.Stanford.EDU Portia status (2/5/90)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 12:06:24 PST
Received: from Jessica.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21083; Mon, 5 Feb 90 12:05:02 -0800
Received: from LOCALHOST by jessica.Stanford.EDU (5.59/25-eef) id AA12924; Mon, 5 Feb 90 12:05:33 PDT
Message-Id: <9002052005.AA12924@jessica.Stanford.EDU>
To: ben@psych.Stanford.EDU, daniel@mojave.Stanford.EDU,
david@playfair.Stanford.EDU, der@psych.Stanford.EDU,
eaf@sumex-aim.Stanford.EDU, f.futures@macbeth.Stanford.EDU,
heck@sunburn.Stanford.EDU, hitt@neon.Stanford.EDU,
instructors@cs.Stanford.EDU, jones@sunburn.Stanford.EDU,
linton@interviews.Stanford.EDU, martin@playfair.Stanford.EDU,
maydan@cs.Stanford.EDU, mcgrory@sunburn.Stanford.EDU,
meng@tilden.Stanford.EDU, mvj@playfair.Stanford.EDU,
nakata@jessica.Stanford.EDU, n.nutrasweet@macbeth.Stanford.EDU,
nick@sunburn.Stanford.EDU, seligman@farlow.Stanford.EDU,
sohie@neon.Stanford.EDU, ullman@cs.Stanford.EDU,
art@playfair.Stanford.EDU, flail@portia.Stanford.EDU,
roland@neon.Stanford.EDU, brinck@neon.Stanford.EDU
Cc: randy@jessica.Stanford.EDU, dennis@jessica.Stanford.EDU,
consult@portia.Stanford.EDU
Subject: Portia status (2/5/90)
Date: Mon, 05 Feb 90 12:05:32 -0800
From: Lance Nakata <nakata@jessica.Stanford.EDU>
Portia remained up for most of Saturday, and then went down Sunday at
9am for an upgrade to Ultrix 3.1. We expected to have Portia back up by
Sunday at noon, but DEC decided to reinstall Ultrix 3.0 from their own
tapes, and then install the 3.1 patches on top of this. We just wanted
them to install the patches so we could be back up by noon, but they
disagreed. Their first attempt failed, so they had to redo everything
(a 3 hour delay). Then we had to rebuild all of /usr since their tapes
didn't match our file system (an extra 4 hours). Once that was done, we
tried to fix as many programs as possible before bringing the system up
for general logins at 9:30pm. All Sweet Hall workstations were up by
10:30pm.
There may be damaged or missing binaries on the system. Also, many of
the /usr/class directories have the wrong protections or owners. Please
send mail to action@portia if you need help fixing these.
We're hoping Portia's network-related crashes will disappear now that
it's running Ultrix 3.1, but we still urge caution since we haven't had
a long testing period. Please let us know if you encounter problems.
Lance Nakata
Academic Information Resources
∂05-Feb-90 1350 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Complexity questions on linear logic
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 13:50:42 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23265; Mon, 5 Feb 90 13:50:40 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24638; Mon, 5 Feb 90 13:50:33 -0800
Message-Id: <9002052150.AA24638@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3213; Mon, 05 Feb 90 15:47:55 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3179; Mon, 05 Feb 90 15:47:43 CST
Date: Mon, 5 Feb 90 15:44:00 CST
Reply-To: "John C. Mitchell" <jcm%cs.stanford.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "John C. Mitchell" <jcm%cs.stanford.edu@VM1.NoDak.EDU>
Subject: Complexity questions on linear logic
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Does anybody know anything about the complexity of decision
problems for propositional linear logic? I have a vague
recollection of hearing something, but no concrete memory
of it. For example, what is the complexity of deciding whether
a propositional formula with connectives -o and ! is provable?
Or with tensor product added?
A specific question that has come up in type inference for
linear logic is, given a propositional formula B, deciding
the set of formulas A such that A -o B is provable/valid.
In relevance logic terms, this is like the problem to
deciding, for formula B, which A are relevant to inferring
B. Come to think of it, does anyone know if this is even
decidable for reasonable fragments of relevance logic R?
Thanks,
John Mitchell
∂05-Feb-90 1422 @Sunburn.Stanford.EDU,@Hudson.Stanford.EDU:jcm@iswim.Stanford.EDU statement of purpose
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 14:22:33 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25400; Mon, 5 Feb 90 14:22:28 -0800
Received: from iswim.Stanford.EDU by Hudson.Stanford.EDU with SMTP (5.61/25-eef) id AA09415; Mon, 5 Feb 90 14:22:00 -0800
Received: by iswim.stanford.EDU (5.57/Ultrix3.0-C)
id AA03959; Mon, 5 Feb 90 13:55:24 PST
Message-Id: <9002052155.AA03959@iswim.stanford.EDU>
To: phd-adm@sunburn.stanford.edu
Subject: statement of purpose
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Mon, 05 Feb 90 13:55:16 PST
Sender: jcm@iswim.Stanford.EDU
It strikes me as strange that so much of the form
space is devoted to GRE/GPA statistics and there
is no line for reaction to statement of purpose.
I think the admissions form the students fill out
says that this is an important part of the appllication,
and I am inclined to agree. (I spoke to Sharon about this,
and she said there was "no space on the form" and
"we don't have a programmer to change it anyway.")
To put my two cents worth into this process,
and make some of my bias clear, I would encourage
those of you who find it useful to read the
students statement of purpose to record any significant
reaction on the official form somewhere.
John
∂05-Feb-90 1429 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu statement of purpose
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 14:29:40 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25562; Mon, 5 Feb 90 14:29:43 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA10165; Mon, 5 Feb 90 14:29:43 PST
Date: Mon, 5 Feb 90 14:29:43 PST
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9002052229.AA10165@coraki.stanford.edu>
To: phd-adm@cs.Stanford.EDU
Subject: statement of purpose
I've been finding "other" a good place for comments about statement
of purpose.
Who reads the comments besides their authors?
-v
∂05-Feb-90 1437 hemenway@Sunburn.Stanford.EDU Statement of Purpose
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 14:36:55 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25855; Mon, 5 Feb 90 14:37:09 -0800
Date: Mon, 5 Feb 1990 14:37:08 PST
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Statement of Purpose
Message-Id: <CMM.0.88.634257428.hemenway@Sunburn.Stanford.EDU>
Just to try to salvage my reputation a bit after John's message, I
might elucidate a bit about the crytic comments he quoted for me...I
am a bit concerned that adding an extra line to the "box" might push
us onto a second page for foreign students who have gone to graduate
school (and thus have the maximum amount of info) and yes,
unfortunately, we are very short of programmer's time. Thus, I
encourage you to use the "other" line to make comments about the
statement of purpose (or write anywhere on the form). No one else
(except Aleta and me) sees the rating sheets.
Sharon
∂05-Feb-90 1510 chandler@Sunburn.Stanford.EDU NSF Program Announcement and Guidelines
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Feb 90 15:10:20 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27034; Mon, 5 Feb 90 15:09:34 -0800
Date: Mon, 5 Feb 1990 15:09:34 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: NSF Program Announcement and Guidelines
Message-Id: <CMM.0.88.634259374.chandler@Sunburn.Stanford.EDU>
I have the following publication in my office. Feel free to come by and look
at it:
Undergraduate Curriculum and Course Development in Engineering, Mathematics
and the Sciences.
∂06-Feb-90 0029 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU This week's talk
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 00:29:40 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00920; Tue, 6 Feb 90 00:28:52 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04303; Tue, 6 Feb 90 00:26:01 -0800
Message-Id: <9002060826.AA04303@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: This week's talk
Date: Tue, 06 Feb 90 00:25:57 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
The AFLB speaker this week will be Anil Gangolli. AFLB will meet
on Thursday at 12:00pm in MJH 252.
Mean-Value Estimation with Markov Chains
A common statistical problem is to estimate the mean of an easily
computable function on a set S under a given distribution P.
We use a theorem of Aldous on the variance of certain estimators
to show two results:
* Given the same number of random input bits, adjacent correlated samples
drawn from a stationary time-reversible Markov chain typically give
better estimates than well-spaced roughly-independent ones drawn
from the same chain. This eliminates a factor of log|S| from
mean-estimation methods bounds based on current second eigenvalue alone
(e.g. Jerrum/Sinclair). As |S| may be exponential in the input size,
the saving can be appreciable. We illustrate with an application
to estimating the mean of a function on restricted permutation data
under the uniform distribution (i.e. on random matchings).
* More interestingly, using a random walk on a type of expander
graph over {0,1}↑k, one can obtain n random binary k-tuples using only
(k + c(n-1)) random input bits, for a constant c independent of k and n.
These samples are correlated but for the purposes of estimating the mean
are essentially as good as independent samples (i.e. n k random bits),
(and much much cheaper). We dicuss the relation of this result
to the recent work of Impagliazzo and Zuckerman (FOCS 89).
∂06-Feb-90 0617 hellman@isl.Stanford.EDU Minority Mentoring
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 06:16:58 PST
Received: from isl.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Tue, 6 Feb 90 06:14:28 PST
Received: by isl.Stanford.EDU (3.2/4.7); Tue, 6 Feb 90 06:16:07 PST
Date: Tue, 6 Feb 90 06:16:07 PST
From: hellman@isl.Stanford.EDU (Martin Hellman)
To: ee-faculty@sierra
Subject: Minority Mentoring
Would you be willing to supervise an undergraduate minority
research assistant? I am planning on putting in a proposal to
ask for funds to pay for their time and need to know how many
faculty would be interested. If it goes according to plan, the
grant would pick up their salary (approximately $8-10 per hour
for 10 hours per week). Your commitment would be for one quarter
at a time, so you could see how it is working out.
The goal is to get more faculty (and grad student) mentoring of
our minority undergraduates. I have seen a lot of untapped
potential (e.g., a black student pulled up from a 2.5 GPA to a
3.5 when I showed some interest in him) and believe that this
kind of interaction could help a lot.
Since the proposal is due in less than two weeks, please reply
before Monday 2/12 even if it means your answer is a probability
rather than a yes or no. Thanks.
Martin Hellman
∂06-Feb-90 0826 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STACS '90, Rouen
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 08:26:47 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18347; Tue, 6 Feb 90 08:26:54 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10643; Tue, 6 Feb 90 08:23:57 -0800
Message-Id: <9002061623.AA10643@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7880; Tue, 06 Feb 90 10:13:04 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7856; Tue, 06 Feb 90 10:12:57 CST
Date: Tue, 6 Feb 90 10:10:40 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Thomas Lengauer <tl@forseti.uni-paderborn.de>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Thomas Lengauer <tl%forseti.uni-paderborn.de@VM1.NoDak.EDU>
Subject: STACS '90, Rouen
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
AFCET GI
STACS 90, Rouen
7th Symposium on Theoretical Aspects of Computer Science
February 22-24, 1990
Palais des Congres
Place de la Cathedrale
Rouen, France
The Symposium on Theoretical Aspects of Computer Science is organized jointly
by the Special Interest Group for Applied Mathematics of AFCET (Association
Francaise pour la Cybernetique Economique et Technique) and the Special
Interest Group for Theoretical Computer Science of GI (Gesellschaft fuer
Informatik). It is alternatively held in France and in Germany (Paderborn in
1989, Bordeaux in 1988 etc. ...).
Program Committee
J. Beauquier (Orsay), C. Choffrut (Rouen, Chairman), P. Darondeau (Rennes), H.
Ehrig (W. Berlin), H. Jung (E. Berlin), T. Lengauer (Paderborn, Chairman), E.W.
Mayr (Frankfurt), F. Orejas (Barcelona), M.H. Overmars (Utrecht), A. Restivo
(Palermo), P. Schupp (Urbana), J.M. Steyaert (Palaiseau), K.W. Wagner
(Wuerzburg)
This symposium will include systems exhibitions.
Sponsored by
CNRS, Universite de Rouen, Conseil Regional de Haute Normandie
SCIENTIFIC PROGRAM
Thursday, February 22, 1990
Session 1: Complexity I (H. Jung, Chairman)
9.00 - 9.50 Invited lecture: The complexity of local optimization
M. Yannakakis (Murray Hill, USA)
10.15 - 10.45 Counting classes: thresholds, parity, mods and fewness
R. Beigel, J. Gill and U. Hertrampf (Yale, Stanford, USA &
Wuerzburg, W. Germany)
10.45 - 11.15 A note on the almost-everywhere hierarchy for nondeterministic
time
E. Allender, R. Beigel, U. Hertrampf and S. Homer (Wuerzburg,
W. Germany & New Brunswick, New Haven, Boston, USA)
11.15 - 11.45 Minimal pairs and complete problems
K. Ambos-Spies, S. Homer and R.I. Soare (Heidelberg, W.
Germany & Boston, Chicago, USA)
11.45 - 12.15 Hard promise problems non-uniform complexity
L. Longpre and A.L. Selman (Boston, USA)
Session 2: Computational Geometry (M.H. Overmars, Chairman)
14.00 - 14.30 Minimum vertex hulls for polyhedral domains
G. Das and D. Joseph (Wisconsin, USA)
14.30 - 15.00 On the construction of abstract Voronoi diagrams
K. Mehlhorn, St. Meiser and C.O. Dunlaing (Saarland, W.
Germany & Dublin, Ireland)
15.00 - 15.30 Approximation of convex figures by pairs of rectangles
O. Schwarzkopf, U. Fuchs, G. Rote and E. Welzl (Berlin, W.
Germany & Graz, Austria)
Session 3: Semantics (P. Darondeau, Chairman)
16.00 - 16.30 Towards a process semantics in the logic programming style
A. Corradini and U. Montanari (Pisa, Italy)
16.30 - 17.00 Relation-sorted algebraic specifications with built-in
coercers: Basic notions and results
H.-J. Kreowski and Z. Qian (Bremen, W. Germany)
17.00 - 17.30 Failures semantics based on interval semiwords is a congruence
for refinement
W. Vogler (Muenchen, W. Germany)
Friday, February 23, 1990
Session 4: Algorithms (J.M. Steyaert, Chairman)
9.00 - 9.50 Invited lecture: Combinatorial methods in computer science
G. Viennot (Bordeaux, France)
10.15 - 10.45 Nonblocking graphs: Greedy algorithms to compute disjoint
paths
A. Schwill (Oldenburg, W. Germany)
10.45 - 11.15 Updating almost complete trees or one level makes all the
difference
T. Lai and D. Wood (Waterloo, Canada)
11.15 - 11.45 Sorting the sums (xi + yj) in O(n2) comparisons
J.-L. Lambert (Orsay, France)
11.45 - 12.15 Parallel computations on strings and arrays
M. Crochemore and W. Rytter (Paris, France & Warsaw, Poland)
Session 5: Complexity II (H. Ehrig, Chairman)
14.00 - 14.30 Playing games of incomplete information
J. Cai, A. Condon and R.J. Lipton (Princeton, Wisconsin, USA)
14.30 - 15.00 Efficient checking of computations
R.J. Lipton (Princeton, USA)
15.00 - 15.30 Kolmogorov complexity, restricted nondeterminism and
generalized spectra
D. Joseph and M. Sitharam (Madison, USA)
Session 6: Rewriting systems, cryptography (J. Beauquier, Chairman)
16.00 - 16.30 Combinatorial rewriting on traces
V. Diekert (Muenchen, W. Germany)
16.30 - 17.00 Hiding instances in multi-oracle queries
D. Beaver and J. Feigenbaum (Harvard, Murray Hill, USA)
17.00 - 17.30 Semi-commutations and algebraic languages
M. Clerbout and Y. Roos (Lille, France)
Saturday, February 24, 1990
Session 7: Automata and formal languages (C. Choffrut, Chairman)
9.00 - 9.50 Invited lecture: Computational aspects of structural
recursion
K. Indermark (Aachen, W. Germany)
10.15 - 10.45 The ring of k-regular sequences
J.-P. Allouche and J. Shallit (Bordeaux, France & Hanover,
USA)
10.45 - 11.15 Computational power of one-way multihead finite automata
M. Kutylowski (Wroclaw, Poland)
11.15 - 11.45 Caterpillars and context-free languages
M.P. Chytil and B. Monien (Prague, Czechoslovakia & Paderborn,
W. Germany)
11.45 - 12.45 Infinite trees and automata definable relations over w-words
W. Thomas (Aachen, W. Germany)
GENERAL INFORMATION
Location and dates
The conference will be held on February 22-24, 1990 in the Palais des Congres
Place de la Cathedrale right in the historical center of Rouen in front of the
cathedral.
Lunches
The lunches are not included in the registration fees. A list of restaurants
near the Palais des Congres will be provided with the registration kit.
Social event
A reception will be organized on Thursday evening, February 22 by the Conseil
Regional de Haute Normandie.
Access to Rouen and to the Palais des Congres
>From Paris SAINT-LAZARE SNCF train station. Approximately 1 hour travel.
>From Rouen SNCF train station 10 minutes walk to the Palais des Congres.
>From Paris by road: A 13 motorway direct to Rouen.
Payment
Payments will be accepted only in French Francs either by credit card (Visa
International or Master Card) or by banker's draft to the order of AFCET,
Bank Account: 502 650 009-02, BIMP 22 rue Pasquier, F-75008 Paris.
(Please ask your bank to indicate your name and STACS 90 in order to avoid
any error.) Bank charges on payments in other currencies, or for payments
made in any other way, will be at the participants expense and will be
collected at the conference. For French residents only it is also possible
to pay by cheque to the order of AFCET or by CCP. To guarantee your
registration, complete the charge authorization or enclose a copy of your
bank transfer.
Cancellations
Refunds of 50 % will be made if a written request is received by February 8,
1990. No refunds will be made for cancellations received after February 8,
1990. In case of conference cancellation for reasons beyond its control, AFCET
limits its liability to the registration fees already paid.
Proceedings
The proceedings will be published by Springer Verlag (in the series Lecture
Notes in Computer Science) and distributed to registered participants.
Travel discounts
A 20 % reduction for French Railway round trip tickets can be obtained for
the conference dates. Please complete the appropriate portion of the
registration form to receive your discount ticket(s).
Hotel Reservations
Please complete the accomodation reservation form and send it to WAGONS-LITS.
CONFERENCE REGISTRATION FORM - STACS 90
Send this form to: AFCET - STACS 90
156, boulevard Pereire
75017 Paris FRANCE
Telefax: 33-1-42-67-93-12
(Please type or print)
Name: _______________________________ First Name: _________________________
Firm: _______________________________________________________________________
Address: _____________________________________________________________________
Country: ____________________________________________________________________
Phone: ______________________________ Telefax: _____________________________
Number of invoice copies requested: _________________________________________
Invoice to be sent to: ______________________________________________________
ADVANCE REGISTRATION FEE (before February 8, 1990):
Regular fees Student* * Student rate: is applicable
to all students under 28 years
Conference FF 850 FF 350 on the congress day, a copy of
the student card for the
current year is to be enclosed
with the registration form.
For French non AFCET members, add FF 200 for AFCET 1990 membership
LATE REGISTRATION FEE (beginning February 8, 1990):
Regular fess Student*
Conference FF 950 FF 450
PAYMENT: Conference fee: FF ____________________
AFCET membership: FF ____________________
Total: FF ____________________
AFCET membership number: _____________________________________________________
Credit card: ___ Visa Intl ___ Master Card
Credit card #: ______________________________________________________________
Expiration: _________________________________________________________________
Cardholder's name: __________________________________________________________
Signature: __________________________________________________________________
Date: _______________________________________________________________________
TRAVEL*: [ ] Please send me a local railway discount ticket
* available for the conference dates.
ACCOMODATION RESERVATION FORM - STACS 90
To be returned before January 22, 1990 to:
WAGONS-LITS TOURISME - Service Congres - Melle Anne VIBERT - 40 rue Kleber -
92307 LEVALLOIS PERRET CDX - FRANCE
Phone: 33-1-47-59-45-05 Telefax: 33-1-47-59-46-87 Telex: 611 507
(Please type or print)
Name: _______________________________________________________________________
Address: ____________________________________________________________________
Country: ____________________________________________________________________
Phone: _________________________________ Telex: ___________________________
ACCOMODATIONS
Please reserve: [ ] twin bed room(s) shared by 2 persons [ ] single room(s)
in a hotel of ___ stars from _____ to ______ for ___ nights.
Average rates per room and per night, room basis only, taxes and services
included.
Hotel category: Rate (per night): Required deposit per room:
(*) 1 Star FF 120/220 FF 250
2 Star FF 250/300 FF 400
3 Star FF 430/450 FF 600
(*) Number limited
The hotel deposit will be transmitted to the hotel less FF 60 for reservation
fees and will be deducted from your final bill which you must settle before
leaving.
PAYMENT: Hotel deposit FF ___
[ ] Check payable to WAGONS-LITS TOURISME/FRANCE VOYAGES
[ ] Copy of my bank transfer sent to the account 218 085 19 - BNP PARIS
ST LAZARE - Code bankque 30004 - Code Guichet 00819 - Cle RIB 61 -
WAGONS-LITS TOURISME/FRANCE VOYAGES - Code comptable 96/670
The bank charges must be added to the above amount. Any differences will be
requested locally.
[ ] I duly authorize you to debit my ___ Visa Intl ___ Master Card
Credit card #: __________________________________________________________
Expiration: ______________________________________________________________
VERY IMPORTANT: No reservation will be made if the present form is not
accompanied by the corresponding amount.
CANCELLATIONS: Refunds (less FF 60 registration fees) will be made before
January 22, 1990. No refunds will be made for cancellations received after
January 22, 1990.
Signature: ____________________________ Date: _____________________________
∂06-Feb-90 1211 gilberts@Sunburn.Stanford.EDU MJH Carpets - Weekend
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 12:11:16 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11233; Tue, 6 Feb 90 11:46:20 -0800
Date: Tue, 6 Feb 1990 11:46:19 GMT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Cc: Gilbertson@Sunburn.Stanford.EDU
Subject: MJH Carpets - Weekend
Message-Id: <CMM.0.88.634333579.gilberts@Sunburn.Stanford.EDU>
CSD Folks:
The carpet cleaners will arrive this Friday at 4:30,
to clean the CSD carpets in Bldg 460 on Feb 9 & 10.
(Scheduling was delayed til the weekend). McNevin's
will begin on the fourth floor and work their way down.
If you do not want your individual carpet shampooed,
please put a large note up on your office door; "Do
NOT clean carpets in Rm x", and sign. Please notify
me by e-mail as well.
If you want your rugs cleaned you would help by moving
small items up and out of the way. The shampooers will
work around large desks and file cabinets. Please put
special projects aside to avoid a potential mishap.
Thank you for your cooperation.
-Edie
∂06-Feb-90 1211 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Packing problem, heuristics and algorithms
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 12:11:33 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01072; Tue, 6 Feb 90 11:02:54 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00818; Tue, 6 Feb 90 11:03:06 -0800
Message-Id: <9002061903.AA00818@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0044; Tue, 06 Feb 90 10:41:27 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0024; Tue, 06 Feb 90 10:41:24 CST
Date: Tue, 6 Feb 90 10:40:35 CST
Reply-To: Ricci Francesco <ricci%irst%uunet.uu.net@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ricci Francesco <ricci%irst%uunet.uu.net@VM1.NoDak.EDU>
Subject: Packing problem, heuristics and algorithms
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I wonder if someone has any pointer to the problem of packing arbitrary
objects in a given domain. This problem arises in many real world
applications and I am particularly interested to the texile environment.
Human experts use heuristics but I suppose that optimization techniques
have been used.
Thanks in advance.
Francesco Ricci
***************************************************************************
Francesco Ricci
Istituto per la Ricerca Scientifica e Tecnologica
I38050 Povo (TN)
Italy
e.mail: ricci@irst.uucp
ricci%irst@uunet.uu.net
phone 461-810105
fax 461-810851
****************************************************************************
∂06-Feb-90 1331 chandler@Sunburn.Stanford.EDU NSF Directorate for CISE
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 13:31:41 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22857; Tue, 6 Feb 90 13:32:19 -0800
Date: Tue, 6 Feb 1990 13:32:18 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: NSF Directorate for CISE
Message-Id: <CMM.0.88.634339938.chandler@Sunburn.Stanford.EDU>
Nils received an on-line newsletter. If you are interested in seeing it let
me know and I will forward it on to you.
∂06-Feb-90 1352 chandler@Sunburn.Stanford.EDU NSF Publications
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 13:52:19 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA23959; Tue, 6 Feb 90 13:52:44 -0800
Date: Tue, 6 Feb 1990 13:52:43 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: NSF Publications
Message-Id: <CMM.0.88.634341163.chandler@Sunburn.Stanford.EDU>
I just received the following publication from NSF. If you're interested in
seeing it let me know and I'll send you a photocopy.
Coordination Theory and Collaboration Technology - Proposal deadline: 4/9/90
∂06-Feb-90 1520 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Please send responses for Forum meal attendance. Urgent!
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 15:20:01 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00713; Tue, 6 Feb 90 15:20:00 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA06860; Tue, 6 Feb 90 15:19:17 -0800
Date: Tue, 6 Feb 1990 15:19:15 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: hiller@Hudson.Stanford.EDU
Subject: Please send responses for Forum meal attendance. Urgent!
Message-Id: <CMM.0.88.634346355.tajnai@Hudson.Stanford.EDU>
We have to turn in our guarantees to Tresidder and the Faculty Club.
(Tresidder on Wed. and Faculty Club on Friday). Please reply immediately.
Tuesday, Feb. 13 - Thursday, Feb. 15.
Tuesday 6 - 8 p.m. informal buffet supper, Faculty Club.
Wed. 8 a.m. buffet breakfast. Tresidder
Wed. noon, lunch, Tresidder
Wed. 6:00 social hour; 7:00 banquet, faculty club
Thursday, noon, lunch, Tresidder
Carolyn
∂06-Feb-90 1535 keyes@sierra.STANFORD.EDU Cocktail Hour with the Visiting Committee, Feb. 7
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 15:35:12 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Tue, 6 Feb 90 15:30:58 PST
Date: Tue, 6 Feb 90 15:30:58 PST
From: keyes@sierra.STANFORD.EDU (Gloria L. Keyes)
To: ee-faculty@sierra
Cc: keyes@sierra.STANFORD.EDU
Subject: Cocktail Hour with the Visiting Committee, Feb. 7
Message-Id: <CMM.0.88.634347056.keyes@>
Please remember the cocktail hour from 5:00 to 6:00 PM tomorrow
Feb. 7 at the Faculty Club, Red Lounge. This is an opportunity to
meet the members of the Visiting Committee. Pls RSVP to keyes@sierra
if you have not already done so.
Thank you.
Gloria
∂06-Feb-90 1614 chandler@Sunburn.Stanford.EDU Votes
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 16:10:35 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04719; Tue, 6 Feb 90 16:11:21 -0800
Date: Tue, 6 Feb 1990 16:11:21 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: cheriton@cs.Stanford.EDU, feigenbaum@cs.Stanford.EDU,
golub@cs.Stanford.EDU, guibas@cs.Stanford.EDU, khatib@cs.Stanford.EDU,
manna@cs.Stanford.EDU, mccarthy@cs.Stanford.EDU,
mccluskey@cs.Stanford.EDU, ullman@cs.Stanford.EDU,
wiederhold@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Votes
Message-Id: <CMM.0.88.634349481.chandler@Sunburn.Stanford.EDU>
Because you were absent from the tenured faculty meeting today, I will need
your vote on the following matters. Please respond at your EARLIEST
opportunity as we are up against a deadline with the School of Engineering:
Reappointment of Yoav Shoham as Assistant Professor
Reappointment of David Dill as Assistant Professor
∂06-Feb-90 1719 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Logic Programming Summer School 1990
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Feb 90 17:19:22 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA27190; Tue, 6 Feb 90 17:19:29 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07725; Tue, 6 Feb 90 17:19:07 -0800
Message-Id: <9002070119.AA07725@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1852; Tue, 06 Feb 90 18:39:34 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1829; Tue, 06 Feb 90 18:39:30 CST
Date: Tue, 6 Feb 90 16:54:20 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"Norbert E. Fuchs" <fuchs@ifi.unizh.ch>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "Norbert E. Fuchs" <fuchs%ifi.unizh.ch@VM1.NoDak.EDU>
Subject: Logic Programming Summer School 1990
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
LPSS '90
Logic Programming Summer School
University of Zurich
Switzerland
August 13 - 18, 1990
-----------------------------------------------------------------
-----------------------------------------------------------------
The Logic Programming Summer School 1990 is a joint event of ALP
(Association for Logic Programming), SGAICO (Swiss Group for Ar-
tificial Intelligence and Cognitive Science, a Special Interest
Group of the Schweizer Informatiker Gesellschaft SI), and the
University of Zurich.
Lecturers
---------
Francois Bry (ECRC, Munich, Germany)
Deductive Databases
John Gallagher (University of Bristol, Great Britain)
Program Analysis and Transformation
Robert A. Kowalski (Imperial College, London, Great Britain)
Logic Programming and Knowledge Representation
John W. Lloyd (University of Bristol, Great Britain)
Foundations of Knowledge Base Systems
Rainer Manthey (ECRC, Munich, Germany)
Deductive Databases
Course Director
---------------
Norbert E. Fuchs (University of Zurich, Switzerland)
Program Committee
-----------------
Rene Bach (Ascom Tech Ltd., Switzerland)
Robert Marti (ETH Zurich, Switzerland)
Helmut Schauer (University of Zurich, Switzerland)
About the Logic Programming Summer School
-----------------------------------------
The Logic Programming Summer School will give detailed up-to-date
insight into solutions that logic programming offers to problems
of knowledge-base systems, and will allow participants to evalu-
ate the methodologies and techniques presented with respect to
their own work.
The backbone of the Logic Programming Summer School will be a
series of lectures in a tutorial style on the foundations of
knowledge-base systems, on knowledge representation, on default,
temporal and legal reasoning, on meta-programming, on program
analysis and transformation, and on deductive databases. Thus
both theory and applications of logic programming will be ad-
dressed.
The lectures will present different approaches to the problems
and could well serve as starting points for interesting and pro-
ductive discussions. The organizers of the Summer School will
provide facilities for discussions in small groups and for ad hoc
meetings.
Two to four lectures of 90 minutes are planned for each day. Thus
enough time will remain for discussions, workshops, and relaxa-
tion.
Computers will be available for demonstrations. Participants who
want to demonstrate their work should contact the organizers.
A poster exhibition will allow participants to present their own
work.
Participants
------------
The Logic Programming Summer School is intended for researchers
and practitioners of logic programming and artificial intelli-
gence from all countries. Some background in logic programming
and knowledge-base systems, and some practical experience, will
be a prerequisite. Reading material will be distributed to the
participants before the Summer School. To encourage interaction
and personal contacts the number of participants will be limited.
Applicants should complete the application form and return it to
the contact address before April 30.
Site of the Logic Programming Summer School 1990
------------------------------------------------
The site of the Logic Programming Summer School is the new campus
Irchel of the University of Zurich. The campus is located in a
spacious park adjacent to a forest. Its buildings provide lecture
halls of different sizes, rooms for meetings and workshops, a
restaurant, and a coffeeshop. Ample car parking is available. The
campus is 10-15 minutes by tram from the center of Zurich, a
medium-sized international city located on beautiful Lake Zurich.
Zurich offers all of the amenities of much larger towns. Besides
its well-known banking district and shopping streets, it boasts
the charming and lively 'Altstadt' along the river Limmat. Zurich
is easily reached by all kinds of public transportation.
Contact Address
---------------
LPSS '90
Department of Computer Science
University of Zurich
CH-8057 Zurich
Switzerland
Fax +41-1-257 4343
Telex 817251 unii ch
E-mail fuchs@ifi.unizh.ch
Organization
------------
Ms. Anne-Marie Nicolet
c/o SI Secretariat
Schwandenholzstrasse 286
CH-8052 Zurich
Switzerland
Language
--------
The language of the Summer School will be English.
∂06-Feb-90 1826 LOGMTC-mailer Concurrency Seminar
Received: from linz.stanford.edu by SAIL.Stanford.EDU with TCP; 6 Feb 90 18:25:46 PST
Received: by linz.stanford.edu (5.59/25-eef) id AA05485; Tue, 6 Feb 90 18:27:11 PDT
Message-Id: <9002070227.AA05485@linz.stanford.edu>
To: logmtc@sail, dill@amadeus
Subject: Concurrency Seminar
Reply-To: tah@cs.stanford.edu
Date: 06 Feb 90 18:27:08 PST (Tue)
From: Tom Henzinger <tah@linz>
Friday, Feb. 9, 12:15, MJH 252:
Modeling and Verifying Real-time Systems
Rajeev Alur
Model-checking algorithms for the branching-time logics (eg. CTL)
can be used for the automatic verification of finite-state reactive systems.
We extend this methodology for reasoning about systems used in real-time
applications where the actual magnitudes of timing delays are crucial.
To get a specification language, we extend the syntax of CTL to allow
temporal operators subscripted with time constants limiting their scope. The
formulas of the resulting logic, TCTL -- timed CTL, are interpreted over
``continuous computation trees,'' trees in which paths are maps from the set
of nonnegative reals to system states. To model finite-state systems we
introduce the notion of timed graphs; these are state-transition graphs
extended with a mechanism that allows the expression of constant lower and
upper bounds on the delays between the state transitions.
As our main result, we develop an algorithm for model-checking,
for determining the truth of a TCTL-formula with respect to a timed graph.
On the negative side, we show that the question of deciding whether a given
TCTL-formula is implementable by a timed graph, is unsolvable.
This work appears in a joint paper with Professor David Dill
and Costas Courcoubetis (AT&T Bell Labs), to be presented at LICS-90.
∂07-Feb-90 0828 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Reges Talk
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Feb 90 08:27:56 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25191; Wed, 7 Feb 90 08:28:37 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA01398; Wed, 7 Feb 90 08:22:20 PST
Date: Wed, 7 Feb 90 08:22:20 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002071622.AA01398@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Reges Talk
Stuart Reges, a candidate for the Prof (Teaching)
position, will give an informal talk about his views on
teaching computer science and the computer science
curriculum today (Wednesday) at 4:00 p.m. in
MJH 252. Stuart is the last in a sequence of three
candidates that we are interviewing for this position.
I hope the talk will be well attended so that we can
all make an informed choice about this important
position. Thanks,
-Nils
∂07-Feb-90 1049 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu email through (what's left of) the iron curtain
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Feb 90 10:48:55 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00861; Wed, 7 Feb 90 10:49:18 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA13852; Wed, 7 Feb 90 10:48:24 PST
Message-Id: <9002071848.AA13852@coraki.stanford.edu>
To: faculty@cs.stanford.edu
Subject: email through (what's left of) the iron curtain
Date: 07 Feb 90 10:48:23 PST (Wed)
From: pratt@cs.Stanford.EDU
I received an email message from Branislav Rovan of Comenius
University, Bratislava, Czechoslovakia, mailed Jan. 25, received Jan
26, to which I replied the same day, and received his reply to my
reply this morning, Feb. 7.
This is the first iron curtain email I've seen.
The headers (below) give the route and break down the delays a bit
further. As Rovan's second message indicates, there is just one
internet node in Czechoslovakia. The headers suggest that this node
sends the mail over the phone via uucp to EUnet, which transfers it to
mcsun.EU.net. My guess is that mcsun is at CWI in Amsterdam, anyone
know for sure? I tried telnetting to mcsun from my house and got:
coraki% telnet mcsun.eu.net
Trying 192.16.202.1 ...
Connected to mcsun.eu.net.
Escape character is '↑]'.
SunOS UNIX (mcsun)
login:
Judging by the second header Czechoslovakia is on MET = Central
European Time, one hour ahead of Greenwich Mean Time, nine hours ahead
of us.
-v
header 1:
Return-Path: <@jeeves.stanford.edu,@Polya.Stanford.EDU:iaccs!rovan@relay.EU.net>
Received: from jeeves.stanford.edu by coraki.stanford.edu (4.1/25-eef)
id AA28897; Fri, 26 Jan 90 01:32:44 PST
Received: from Polya.Stanford.EDU by jeeves.stanford.edu (5.59/25-eef)
id AA02483; Fri, 26 Jan 90 01:33:23 PDT
Received: from mcsun.eu.net by Polya.Stanford.EDU with SMTP
(5.61+IDA/25-eef) id AA22727; Fri, 26 Jan 90 01:32:14 -0800
From: iaccs!rovan@relay.EU.net@Polya
Received: by mcsun.EU.net via EUnet; Fri, 26 Jan 90 10:32:05 +0100 (MET)
Message-Id: <9001260645.AA08857@tuvie.tuwien.ac.at>
To: tuvie!pratt@relay.EU.net
Subject: Ivited lecture
Date: Thu Jan 25 08:47:36 1990
header 2 plus tail of message:
Return-Path: <@jeeves.stanford.edu,@Sunburn.Stanford.EDU:iaccs!rovan@relay.EU.net>
Received: from jeeves.stanford.edu by coraki.stanford.edu (4.0/25-eef) id AA13530; Wed, 7 Feb 90 09:03:22 PST
Received: from Sunburn.Stanford.EDU by jeeves.stanford.edu (5.59/25-eef) id AA18338; Wed, 7 Feb 90 09:04:16 PDT
Received: from mcsun.eu.net by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26711; Wed, 7 Feb 90 09:04:04 -0800
Received: by mcsun.EU.net via EUnet; Wed, 7 Feb 90 18:03:01 +0100 (MET)
Received: by iaccs.UUCP (5.51/4.7)
id AA01204; Wed, 7 Feb 90 12:16:26 +0100
Date: Wed, 7 Feb 90 12:16:26 +0100
From: iaccs!rovan@relay.EU.net (doc.branislav Rovan)
Message-Id: <9002071116.AA01204@iaccs.UUCP>
To: tuvie!pratt@relay.EU.net
Subject: MFCS 90
Dear Professor Pratt:
<deleted>
I am almost sure Ivan Havel does not have e-mail yet. To my
knowledge there is only single node in Czechoslovakia at
the institute working on computer network in Czechoslovakia,
which happens to be in Bratislava. I happen to be able to
have my mailbox there (accessed about twice a week by car)
as a courtesy and assistance in my work on the MFCS symposium.
Things are improving fast and I do hope this may change in
a matter of months.
Regards,
Branislav Rovan
∂07-Feb-90 1547 @RELAY.CS.NET:mazzetti@ed.aaai.org
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 7 Feb 90 15:47:41 PST
Received: from relay2.cs.net by RELAY.CS.NET id ae28369; 7 Feb 90 17:46 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa16987; 7 Feb 90 18:42 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA01921; Wed, 7 Feb 90 14:44:19 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA24721; Wed, 7 Feb 90 14:50:30 PST
Date: Wed, 7 Feb 90 14:50:30 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9002072250.AA24721@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Cc: hayes.pa@XEROX.COM, mazzetti@nilsson, taglio@nilsson
Agenda-March 29 Council Meeting
Council Meeting - Agenda
March 29, 1:30 pm
OLD BUSINESS: Grants for CRB and Computer Museum; NEW IJCAII-AAAI contract
STANDING COMMITTEE REPORTS
NEW BUSINESS: AAAI Fellows; Long term investment services; AI History video;
new reports about Project Mercury and NRI; IAAI-media briefing; Success or
Disaster Planning efforts
If I've missed anything, pls alert to those changes.
Thanks, Claudia
∂07-Feb-90 1552 @RELAY.CS.NET:mazzetti@ed.aaai.org
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 7 Feb 90 15:52:32 PST
Received: from relay2.cs.net by RELAY.CS.NET id aa28511; 7 Feb 90 17:52 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa17052; 7 Feb 90 18:46 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA01791; Wed, 7 Feb 90 13:51:20 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA24658; Wed, 7 Feb 90 13:57:35 PST
Date: Wed, 7 Feb 90 13:57:35 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9002072157.AA24658@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Cc: mazzetti@nilsson
Council Meetings - March and July
Here are the scheduled Council Meetings:
Thursday, March 29 in room 252, MJacks Hall, Stanford, 1:00 pm; lunch will be served
Monday, July 30 in the Boardroom, rm 300, Hynes Convention Center, 9:00 am-5pm
Please RSVP.
Thanks, Claudia
∂07-Feb-90 1657 hemenway@Sunburn.Stanford.EDU Round 1 Meeting Again
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Feb 90 16:57:45 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15538; Wed, 7 Feb 90 16:58:51 -0800
Date: Wed, 7 Feb 1990 16:58:50 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Round 1 Meeting Again
Message-Id: <CMM.0.88.634438730.hemenway@Sunburn.Stanford.EDU>
..sigh...needless to say, there has not been a concensus on the
perfect date for the Round 1 meeting. However, before I forge ahead,
schedule the meeting for Monday and upset Vaughan, I thought I would
double-check my impression that *everyone* but Vaughan can make it on
Monday (let's say at 1:00 pm). Please let me know within the next day
or two if you CANNOT make it on Monday, the 19th. I'd like to announce
a firm date/time by Friday afternoon.
Thanks.
Sharon
∂08-Feb-90 1044 @Sunburn.Stanford.EDU:JMC@SAIL.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 10:44:14 PST
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27630; Thu, 8 Feb 90 10:44:44 -0800
Message-Id: <gg9Ji@SAIL.Stanford.EDU>
Date: 08 Feb 90 1043 PST
From: John McCarthy <JMC@SAIL.Stanford.EDU>
To: faculty@CS.STANFORD.EDU
It has just been announced that Marvin Minsky is getting the Japan Prize.
∂08-Feb-90 1132 stager@Sunburn.Stanford.EDU 1990/91 Courses and Degrees
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 11:32:28 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA29140; Thu, 8 Feb 90 11:32:57 -0800
Date: Thu, 8 Feb 1990 11:32:55 GMT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: 1990/91 Courses and Degrees
Cc: stager@Sunburn.Stanford.EDU
Message-Id: <CMM.0.88.634505575.stager@Sunburn.Stanford.EDU>
I'm in the process of putting together our CS Department submission to the
1990/91 "Courses and Degrees". Course and program descriptions are currently
being sent out to instructors and area coordinators for revision. If you
receive one of these memos, please look it over carefully, and send back your
revisions (or your approval of the text as it presently stands) by
FRIDAY, FEBRUARY 23.
***Days/times/staffing will be inserted at a later date.***
Thanks again for your help with this.
Claire
∂08-Feb-90 1501 hemenway@Sunburn.Stanford.EDU Round 1 Meeting Scheduled (for TUESDAY)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 15:01:26 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA06243; Thu, 8 Feb 90 15:02:13 -0800
Date: Thu, 8 Feb 1990 15:02:12 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Round 1 Meeting Scheduled (for TUESDAY)
Message-Id: <CMM.0.88.634518132.hemenway@Sunburn.Stanford.EDU>
After some gentle persuasion from Vaughan (ouch, Vaughan, leggo my
arm!) we have decided to hold the Round 1 meeting on Tuesday, Feb. 20
at 3:00 pm. We realize that some of you might have to come to the
meeting late but encourage everyone to join it as soon as they can.
Although it may end earlier, we should probably be prepared to stay
until 6:00 or so.
Thanks to everyone for your input and patience with this.
Sharon
P.S. The meeting will be in MJH 252.
∂08-Feb-90 1643 LOGMTC-mailer tuesday seminars
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 16:43:45 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA21896; Thu, 8 Feb 90 16:44:42 -0800
Date: Thu, 8 Feb 90 16:44:42 -0800
From: Dinesh Katiyar <katiyar@Neon.Stanford.EDU>
Message-Id: <9002090044.AA21896@Neon.Stanford.EDU>
To: logmtc@sail.stanford.edu
Subject: tuesday seminars
there will be no seminar on the 13th of feb because of
the forsythe lecture that day.
our speakers for the rest of the quarter are -
2/20 narciso marti-oliet
2/27 carolyn talcott
3/6 natarajan shankar
3/13 nils nilsson
-dinesh
∂08-Feb-90 1853 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU The Forum Needs YOUR help
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 18:53:28 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10526; Thu, 8 Feb 90 18:54:04 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA12495; Thu, 8 Feb 90 18:53:31 -0800
Date: Thu, 8 Feb 1990 18:53:29 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@Hudson.Stanford.EDU
Cc: hiller@Hudson.Stanford.EDU
Subject: The Forum Needs YOUR help
Message-Id: <CMM.0.88.634532009.tajnai@Hudson.Stanford.EDU>
I read the business sections in many papers and many business magazines.
However, my barometer is the Forum. I knew before the analysts did that
Lotus was in trouble. Why? When Mitch Kapor left, and I called to encourage
Lotus to continue their Forum membership, I was told, "we aren't doing any
research -- we are building on our present products." I didn't have any
Lotus stock, but if I had, I would have given an immediate sell order.
And what do the Forum barometers tell me now? It is a time of retrenching,
belt tightening, redirecting business thrusts,
getting lean and mean. And what are the barometers that I read?
1. Since the first of September 11 companies have dropped their Forum
membership. 7 new companies have joined. We are down to 76 member
companies with 2 more on the line (Ford Aerospace and Philips BV).
2. Recruiting of our students is the lightest it has been in years. Some of
our students may have problems finding good jobs when they graduate.
3. Visiting scholars are not clamoring at the door as much as
they were this time last year.
WHAT CAN YOU DO TO HELP TURN THIS AROUND?
First, attend as many functions of the annual meeting next week as you
possibly can. Go up to strangers and introduce yourself. Most of us
in computer science are introverts. I am one also, and it is no easier for
me to go up to strangers than it is for you. We will
have company presidents, vice presidents and other high ranking people
in the companies coming to the annual meeting. At the meal functions,
don't sit next to people you know, but make an effort to sit next to
our visitors and make an effort to talk to them about their technical
interests.
After the Forum is over:
Help recruit new members to the Forum and help get some of those who
have dropped back in. Are you consulting for a company that isn't a
member? Charge them a higher rate! Some of our professors refuse to
consult for a company that doesn't belong to the Forum and one professor
charges 50% higher rate. This is entirely voluntary, but it can make
an impact.
Send the names and addresses of prospects to me, and I'll send information
packets. Help find research colleagues in the companies.
Some of the companies who have dropped in the past couple of years:
Recent drops:
3M
Abe (Japan)
CSK Research Institute (Japan)
Fuji Xerox (Japan)
General Motors
Kodak
Nixdorf (Germany)
Rolm Mis-spec
Salomon Brothers
Teknekron
Unisys
Others who have dropped:
ARCO
Advanced Decision Systems
Amdahl (over 8 years ago)
BBN
BNR
Chevron
Control Data
Data General
General Dynamics
Honeywell
Lockheed
MCC
National Semiconductor
Pacific Bell
Plessey
Texaco
Varian
And some I've been working on unsuccessfully:
Silicon Graphics
NeXt
3Com
Intellicorp
Adobe Systems
Please let me know what you will do to help.
Carolyn
∂08-Feb-90 1936 hemenway@Sunburn.Stanford.EDU Batch 3 & 4 Applications
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 19:36:24 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10678; Thu, 8 Feb 90 19:37:31 -0800
Date: Thu, 8 Feb 1990 19:37:30 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Batch 3 & 4 Applications
Message-Id: <CMM.0.88.634534650.hemenway@Sunburn.Stanford.EDU>
You will most likely notice in this batch and the next one that some of
the applications you'll see will be missing some credentials. I put
into this batch applications which were missing one letter of
recommendation (but nothing else) and applications without a GRE
subject test score. I know that this makes it more difficult for you
but I would hate to have us miss someone because one of his
recommenders was tardy. The subject test score is a bit more
problematic (since we do indicate in our materials that it is
required) but I leave it to you to interpret the absence of that
information as you each think most appropriate.
Sharon
∂08-Feb-90 2107 LOGMTC-mailer Lunchtime Logic discussion led by Prof. Mints: 12noon, Wed. Feb 14
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Feb 90 21:07:44 PST
Received: from argon.csl.sri.com by csli.Stanford.EDU (4.0/inc-1.0)
id AA20395; Thu, 8 Feb 90 21:09:20 PST
Received: by argon.csl.sri.com at Thu, 8 Feb 90 21:03:59 -0800.
(5.61.11/XIDA-1.2.8.27) id AA12648 for logic@csli.stanford.edu
Date: Thu, 8 Feb 90 21:03:59 -0800
From: Natarajan Shankar <shankar@csl.sri.com>
Message-Id: <9002090503.AA12648@argon.csl.sri.com>
To: logic@csli.stanford.edu
Subject: Lunchtime Logic discussion led by Prof. Mints: 12noon, Wed. Feb 14
Prof. Grigori Mints will lead a discussion on "Some problems in the
neighborhood of mathematical logic."
Place: SRI International BN182
***Bring your lunch***
_____________________________________________________________________________
If you wish to attend and either have some kind of security clearance
or are a citizen of a designated country (east bloc, for instance),
please contact Shankar (859-5272) so that I can talk you out of
attending. Non SRI attendees should register at Bldg. A and
ask for Judith (859-5924).
∂09-Feb-90 0015 @RELAY.CS.NET:mazzetti@ed.aaai.org Point of clarification
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 9 Feb 90 00:15:23 PST
Received: from relay2.cs.net by RELAY.CS.NET id ae12356; 9 Feb 90 2:14 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa11408; 9 Feb 90 3:11 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA03276; Thu, 8 Feb 90 19:30:36 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA25664; Thu, 8 Feb 90 19:36:54 PST
Date: Thu, 8 Feb 90 19:36:54 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9002090336.AA25664@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@SCORE.STANFORD.EDU, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@SCORE.STANFORD.EDU, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Subject: Point of clarification
Cc: mazzetti@nilsson
The Council meeting on Thursday, March 29, is at 1:30 pm not 1:00 pm.
Claudia
∂09-Feb-90 0042 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU NIPS-90 WORKSHOPS Call for Proposals
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 00:42:05 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15190; Fri, 9 Feb 90 00:42:41 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12026; Fri, 9 Feb 90 00:42:30 -0800
Message-Id: <9002090842.AA12026@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2988; Fri, 09 Feb 90 02:40:08 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2925; Fri, 09 Feb 90 02:40:05 CST
Date: Thu, 8 Feb 90 08:48:49 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Steve Hanson <jose@neuron.siemens.com>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Steve Hanson <jose%neuron.siemens.com@VM1.NoDak.EDU>
Subject: NIPS-90 WORKSHOPS Call for Proposals
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
REQUEST FOR PROPOSALS
NIPS-90 Post-Conference Workshops
November 30 and December 1, 1990
Following the regular NIPS program, workshops on current topics
on Neural Information Processing will be held on November 30 and
December 1, 1990, at a ski resort near Denver. Proposals by
qualified individuals interested in chairing on of these
workshops are solicited.
Past topics have included: Rules and Connectionist Models;
Speech; Vision; Neural Network Dynamics; Neurobiology;
Computational Complexity Issues; Fault Tolerance in Neural
Networks; Benchmarking and Comparing Neural Network Applications;
Architectural Issues; Fast Training Techniques; VLSI; Control;
Optimization, Statistical Inference, Genetic Algorithms.
The format of the workshop is informal. Beyond reporting on past
research, their goal is to provide a forum for scientists
actively working in the field to freely discuss current issues of
concern and interest. Sessions will meet in the morning and in
the afternoon of both days, with free time in between for the
ongoing individual exchange or outdoor activities. Specific open
or controversial issues are encouraged and preferred as workshop
topics. Individuals interested in chairing a workshop must
propose a topic of current interest and must be willing to accept
responsibility for their group's discussion. Discussion leaders'
responsibilities include: arrange brief informal presentations
by experts working on this topic, moderate or lead the
discussion, and report its high points, findings and conclusions
to the group during evening plenary sessions, and in a short (2
page) summary.
Submission Procedure: Interested parties should submit a short
proposal for a workshop of interest by May 17, 1990. Proposals
should include a title and a short description of what the
workshop is to address and accomplish. It should state why the
topic is of interest or controversial, why it should be discussed
and what the targeted group of participants is. In addition,
please send a brief resume of the prospective workshop chair,
list of publications and evidence of scholarship in the field of
interest.
Mail submissions to:
Dr. Alex Waibel
Attn: NIPS90 Workshops
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
Name, mailing address, phone number, and e-mail net address
(if applicable) must be on all submissions.
Workshop Organizing Committee:
Alex Waibel, Carnegie-Mellon, Workshop Chairman;
Kathie Hibbard, University of Colorado, NIPS Local Arrangements;
Howard Watchel, University of Colorado, Workshop Local Arrangements;
PROPOSALS MUST BE RECEIVED BY MAY 17,1990
Please Post
∂09-Feb-90 0042 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Parallel graph reduction and lambda calculus replies
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 00:42:27 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15194; Fri, 9 Feb 90 00:43:06 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12029; Fri, 9 Feb 90 00:43:07 -0800
Message-Id: <9002090843.AA12029@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3180; Fri, 09 Feb 90 02:40:37 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3075; Fri, 09 Feb 90 02:40:33 CST
Date: Thu, 8 Feb 90 08:48:59 CST
Reply-To: sreedhar%longhair.cs.unlv.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: sreedhar%longhair.cs.unlv.edu@VM1.NoDak.EDU
Subject: Parallel graph reduction and lambda calculus replies
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The following are the replies I recieved on PRG
--------------------------------------------------
From: peter@fwi.uva.nl
Dear sir. Your request on information on PGR is well directed to Amsterdam,
but not in the theory research group. We had last year two PhD granted
on the subject of parallel grapg reduction in the computer systems group.
I suggest therefore that you contact these researchers directly:
Wim Vree: email : vree@fwi.uva.nl
Piter Hartel: email pieter@ecs.soton.ac.uk
-----------------------------------------------------------
From: Arch Robison <robison@cs.uiuc.edu>
A bit old, but you can probably trace from it forwards via a citation index:
Lecture Notes in Computer Science, vol 279, "Proc. Workshop on Graph
Reduction, Los Alamos NM, Sept. 28-Oct. 1, 1986.
See also:
Lect. Notes. in CS, vol. 201 = "Proc. of Second Conf. on Functional
Programming Languages and Computer Architecture, Nancy France,
Sept 1985"
Lect. Notes. in CS, vol. 259 = "PARLE: Parallel Architectures and
Languages Europe"
Lect. Notes. in CS, vol. 274 = "Proc. of Third Conf. on Functional
Programming Languages and Computer Architecture, Portland OR, Sept 1987"
I believe there is also a Proc. of Fourth Conf. on Functional ...,
but I don't have it in my files.
Arch D. Robison
University of Illinois at Urbana-Champaign
------------------------------------------------------------------
From: "H.Ludwig Hausen +49-2241142426"
<HAUSEN%DBNGMD21.BITNET@cunyvm.cuny.edu>
Hello, unfortunately I can't supply you with input, but I would
appreciate to receive a summary or just copies of the response
to your inquiry. I would like to get that information to our students.
Thanks in advance,
H. LUDWIG HAUSEN . Telephone +49-2241-14-2440 or 2426
GMD Schloss Birlinghoven . Telefax +49-2241-14-2618 or 2889
D-5205 Sankt Augustin 1 . Teletex 2627-224135=GMD VV
West GERMANY . Telex 8 89 469 gmd d
. E-MAIL: HAUSEN@DBNGMD21.BITNET
. . . . . . . . . . . . . . . . . or: HAUSEN@MVS.GMD.DBP.de
. GMD Gesellschaft fuer Mathematik und Datenverarbeitung
. German National Research Institute for Computer Science
-----------------------------------------------------------------
I have collected about 20 articles on Graph reduction for
combinators and lambda calculus. If anybody is interested
either I can email the list or post.
Thank you every body
∂09-Feb-90 0045 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Monkeys are NP-complete
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 00:45:14 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15237; Fri, 9 Feb 90 00:45:53 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12033; Fri, 9 Feb 90 00:43:30 -0800
Message-Id: <9002090843.AA12033@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3275; Fri, 09 Feb 90 02:41:04 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3225; Fri, 09 Feb 90 02:40:53 CST
Date: Thu, 8 Feb 90 08:49:09 CST
Reply-To: David Harel <harel%wisdom.weizmann.ac.il@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: David Harel <harel%wisdom.weizmann.ac.il@VM1.NoDak.EDU>
Subject: Re: Monkeys are NP-complete
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
"David,
NP-completeness of Tiling (or, as you call it, Monkey problem) is given in my
1973 paper. To prove it just consider straightforwardly the space-time history
of the computation of a Universal Turing Machine, verifying the witness of an
arbitrary NP-problem. Tiling is even complete for an "average" instance, while
most other problems are only "worst-case NP-complete".
Yours, Leonid Levin."
Hi Leonid,
I know about your proof of the tiling problem. It is NOT the same as the
monkey problem, not because we have monkeys instead of colored tiles, but
because we are given a FULL set of n↑2 tiles and we have to use them ALL
exactly once. The reductions from computations of TMs use a fixed set
of tiles constructed from the TM and used (possibly only some of them)
more than once. The case where you have the full set and have to use them
all exactly once cannot, I think, be proved in this way. Hence the need for
a different proof. I hope you see easily that this is needed.
David
∂09-Feb-90 0101 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Cube-Connected Cycles
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 01:01:23 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15501; Fri, 9 Feb 90 01:02:02 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12177; Fri, 9 Feb 90 01:02:08 -0800
Message-Id: <9002090902.AA12177@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1774; Fri, 09 Feb 90 03:00:18 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1699; Fri, 09 Feb 90 03:00:16 CST
Date: Thu, 8 Feb 90 09:52:22 CST
Reply-To: Rolf Wanka <wanka%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Rolf Wanka <wanka%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Subject: Re: Cube-Connected Cycles
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Hi,
some days before I posted the question, where I can find the
proof that the Cube-Connected Cycles network
by Preparata & Vuillemin has an Hamiltonian cycle.
I forgot the warning, that I think that this problem is more
difficult than it seems to be on the first look.
I think I have a non-constructive proof, but this proof
is not very aesthetical (if it is correct at all; this is not the
main-problem of my daily work, it came up during an
exercise for a lecture on Parallel Algorithms at
University of Paderborn).
Rolf Wanka
--------
Date: 1 Feb 90 16:12:47 GMT
From: wanka@pbinfo.uni-padeborn.de (Rolf Wanka)
Organization: Uni-GH Paderborn, Germany
Subject: Re: Cube-Connected Cycles
Message-Id: <1055@pbinfo.UUCP>
References: <1046@pbinfo.UUCP>, <1050@pbinfo.UUCP>
Hello,
the question, where to find the statement that the Cube-Connected
Cycles network has an Hamiltonian cycle, is answered.
References are:
- A. M. Schwartz and M. C. Loui,
Dictionary machines on cube-class networks,
IEEE Transactions on Computers,
vol. C-36, no. 1, pp. 100-105, January 1987.
- T. Leighton, Lecture Notes (MIT)
My very special thanks to Walter Hohberg (University of Dortmund, FRG)
who found a beautyful construction, and M. C. Loui (University of
Illinois, Urbana, USA).
Rolf Wanka
---------------------------------------------------------------------------
UUCP: wanka@pbinfo.UUCP | Rolf Wanka
or wanka@pbinfo.uni-paderborn.de | Universitaet-GH Paderborn
or ...!uunet!unido!pbinfo!wanka | Fachbereich 17-Mathematik/Informatik
CSNET: wanka%pbinfo.uucp@Germany.CSNET | Warburger Str. 100
ARPA: wanka@pbinfo.uni-paderborn.de | D-4790 Paderborn, West Germany
---------------------------------------------------------------------------
∂09-Feb-90 0102 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: CFGs with few nonterminals
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 01:02:13 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15525; Fri, 9 Feb 90 01:02:48 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12187; Fri, 9 Feb 90 01:02:27 -0800
Message-Id: <9002090902.AA12187@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1660; Fri, 09 Feb 90 02:59:57 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1628; Fri, 09 Feb 90 02:59:53 CST
Date: Thu, 8 Feb 90 09:50:27 CST
Reply-To: John E Van Deusen III <visdc!jiii%uunet.uu.net@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: John E Van Deusen III <visdc!jiii%uunet.uu.net@VM1.NoDak.EDU>
Subject: Re: CFGs with few nonterminals
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <1373.25bf3db5@csc.anu.oz> bdm659@csc.anu.oz writes:
>
> Let CF[k] be the set of all languages which are generated by some
> context free grammar with at most k nonterminal symbols (k=1,2,...).
>
> Is anything known about these language classes? For example,
> is CF[k] a proper subset of CF[k+1] for all k?
Let G = (N,E,P,S) and G' = (N',E,P',S) be CFGs,
where N = {S, A1,...,Ak-2} and N' = {S, A1,...Ak-1} are the respective
sets of nonterminals.
If k < 0 then L(G) = L(G') = {}, because |N| and |N'| <= 0.
There can be no productions; since P is a subset of N x (V)*, where
V = N union E.
If k = 0, the language of G is still the empty set, but N' = {S}, by
definition. Thus there can exist some G' such that L(G') is not the
empty set. For example, the production
S -> a, for a in E, produces the language {a}.
Even if E = {}, L(G) is at least the empty word. Thus L(G) is a proper
subset of L(G') for k = 0.
What about k > 0?
Assume without loss of generality that G is an arbitrary reduced CFG
with no unit productions, since it is always possible to convert any
arbitrary CFG to that form.
Basis:
Let k = 1. By definition N = {S} and N'= {S,A}, where A is an
arbitrary symbol disjoint from E. There exists some G' such that
(S, B1 A B2) is in P, and B1 and B2 are in V*.
For any possible (A, Bx) in P, Bx must be a subset of E*. This is
because there are no other nonterminals in N, and there are no unit
productions, A -> A, in P.
For every (A, Bx) production in P, we can add the productions
(S, B1 Bx B2) to P. In that way, we can make A an unreachable symbol
and thereby eliminate it from P without affecting L(G). Therefore,
the language L(G') of any CFG, G' with 2 nonterminals can be expressed
by some CFG, G, having one nonterminal.
Induction hypothesis:
Assume we can do this for k = n, where n > 1.
Induction step:
Let k = n + 1.
By the same reasoning as before, for any possible production (An, Bx),
Bx is in E*. Thus we can replace all productions of the form
(An-1, B1 An B2) with the set of productions (An-1, B1 Bx B2), for all
Bx such that (An, Bx) is in P.
Thus, by induction, any CFG, G', having |N'| > 1 can be expressed as an
equivalent CFG, G, having |N| = 1. Therefore the set of all CFL
languages that can be expressed with one nonterminal is not a proper
subset of all the CFL languages that can be expressed with more than one
nonterminal.
--
John E Van Deusen III, PO Box 9283, Boise, ID 83707, (208) 343-1865
uunet!visdc!jiii
------
Date: 28 Jan 90 11:43:57 GMT
From: bdm659@csc1.anu.oz.au (Brendan McKay)
Organization: Computer Services, Australian National University
Subject: Re: CFGs with few nonterminals
Message-Id: <1385.25c2dafd@csc.anu.oz>
References: <1373.25bf3db5@csc.anu.oz>, <734@visdc.UUCP>
Your grammar trasformations do not preserve the language generated. Your
conclusion is false. A number of private correspondents have indicated
that it is fairly easy to show that CF[k] is a proper subset of CF[k+1].
The simplest demonstration was from Tao Jiang, who points out that the
regular language
a1+ union a2+ union ... union ak+
is in CF[k+1]-CF[k] for k >= 2, where a1, ..., ak are distinct nonterminals,
and "+" is the usual nontrivial-closure operation. (Alternatively,
a1, ..., ak can be suitably chosen binary strings.) Tao also suggests a
reference, which I will post information on as soon as I can find it.
Brendan McKay. bdm@anucsd.oz(.au) or bdm659@csc1.anu.oz(.au)
terrorist: n. an individual who behaves like a government
--------
Date: 29 Jan 90 01:51:55 GMT
From: visdc!jiii@uunet.uu.net (John E Van Deusen III)
Organization: VI Software Development Company, Boise, Idaho
Subject: Re: CFGs with few nonterminals
Message-Id: <738@visdc.UUCP>
References: <1373.25bf3db5@csc.anu.oz>, <734@visdc.UUCP>
I'm sorry. Bx can NOT be a subset of E*, or A would be a useless
production and would have been be eliminated by the assumption of a
reduced grammar. This would provide a basis for NOT being able to
obtain the same expressive power with some CFG utilizing k - 1
nonterminals. A counter example is G:
S -> SS | A | c
A -> aAb | ab
The language L(G) can not be produced by a CFG utilizing only the
nonterminal S, unless the words in L(G) are constrained to have
finite length.
--
John E Van Deusen III, PO Box 9283, Boise, ID 83707, (208) 343-1865
uunet!visdc!jiii
-------
Date: 31 Jan 90 18:17:57 GMT
From: bdm659@csc1.anu.oz.au (Brendan McKay)
Organization: Computer Services, Australian National University
Subject: Re: CFGs with few nonterminals
Message-Id: <1408.25c72bd5@csc.anu.oz>
References: <1373.25bf3db5@csc.anu.oz>, <734@visdc.UUCP>
The following papers of J. Gruska contain information on these classes:
* On a classification of context-free grammars, Kybernetika 3 (1967) 22-29.
* Some classifications of context-free languages, Information and Control,
14 (1969) 152-173.
* Complexity and unambiguity of context-free grammars and languages,
Information and Control, 18 (1973) 502-519.
Thanks to all those who responded by my query.
==================================
Brendan McKay. bdm@anucsd.oz(.au) or bdm659@csc1.anu.oz(.au)
terrorist: n. an individual who behaves like a government
∂09-Feb-90 0113 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Distributed Database Systems (Information Request)
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 01:13:02 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15799; Fri, 9 Feb 90 01:13:43 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12421; Fri, 9 Feb 90 01:13:00 -0800
Message-Id: <9002090913.AA12421@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2323; Fri, 09 Feb 90 02:35:06 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2268; Fri, 09 Feb 90 02:35:04 CST
Date: Thu, 8 Feb 90 07:46:13 CST
Reply-To: "B. Sam Blanchard" <sam%bsu-cs.bsu.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "B. Sam Blanchard" <sam%bsu-cs.bsu.edu@VM1.NoDak.EDU>
Subject: Distributed Database Systems (Information Request)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am looking for information on the current state and future trends of
distributed databases. Both business and theory leads will be helpful.
I would also like names and addresses (email if possible) of people using,
designing, implementing, researching or thinking on the subject along with
some brief introduction to thier orientation.
I promise not to expect too much. I will attempt to contact the individuals
after I have a more formal direction of inquiry.
No information is too small at this point.
I will summarize eventually.
Thanks in advance
--
B. Sam Blanchard UUCP: <backbones>!{iuvax,pur-ee}!bsu-cs!sam
ARPA: sam@bsu-cs.bsu.edu
∂09-Feb-90 0318 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU NIPS-90 CALL For Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 03:18:04 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA27372; Fri, 9 Feb 90 03:18:29 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12599; Fri, 9 Feb 90 03:18:28 -0800
Message-Id: <9002091118.AA12599@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8927; Fri, 09 Feb 90 04:37:41 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7905; Fri, 09 Feb 90 04:37:37 CST
Date: Thu, 8 Feb 90 11:12:45 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Steve Hanson <jose@neuron.siemens.com>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Steve Hanson <jose%neuron.siemens.com@VM1.NoDak.EDU>
Subject: NIPS-90 CALL For Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
IEEE Conference on
Neural Information Processing Systems
-Natural and Synthetic-
Monday, November 26 - Thursday, November 29, 1990
Denver, Colorado
This is the fourth meeting of an inter-disciplinary conference
which brings together neuroscientists, engineers, computer
scientists, cognitive scientists, physicists, and mathematicians
interested in all aspects of neural processing and computation.
Two days of focused workshops will follow at a nearby ski area
(Nov 30-Dec 1). Major categories and examples of subcategories
for paper submissions are the following;
Neuroscience: Neurobiological models of development,
cellular information processing, synaptic function, learning
and memory. Studies and analyses of neurobiological
systems.
Implementation and Simulation: Hardware implementation of
neural nets. VLSI, Optical Computing, and practical issues
for simulations and simulation tools.
Algorithms and Architectures: Description and experimental
evaluation of new net architectures or learning algorithms:
data representations, static and dynamic nets, modularity,
rapid training, learning pattern sequences, implementing
conventional algorithms.
Theory: Theoretical analysis of: learning, algorithms,
generalization, complexity, scaling, capability, stability,
dynamics, fault tolerance, sensitivity, relationship to
conventional algorithms.
Cognitive Science & AI: Cognitive models or simulations of
natural language understanding, problem solving, language
acquisition, reasoning, skill acquisition, perception, motor
control, categorization, or concept formation.
Applications: Neural Networks applied to signal processing,
speech, vision, character recognition, motor control,
robotics, adaptive systems tasks.
Technical Program: Plenary, contributed and poster sessions will
be held. There will be no parallel sessions. The full text of
presented papers will be published.
Submission Procedures: Original research contributions are
solicited, and will be carefully refereed. Authors must submit
six copies of both a 1000-word (or less) summary and six copies
of a separate single-page 50-100 word abstract clearly stating
their results by May 17, 1990. At the bottom of each abstract
page and on the first summary page indicate preference for oral
or poster presentation and specify one of the above six broad
categories and, if appropriate, sub-categories (For example:
POSTER-Applications: Speech, ORAL-Implementation: Analog VLSI).
Include addresses of all authors at the front of the summary and
the abstract and to which author correspondence should be
addressed. Submissions will not be considered that lack category
information, separate abstract sheets, the required six copies,
author addresses or are late.
Mail Submissions To: Mail Requests For Registration Material To:
John Moody Kathie Hibbard
NIPS*90 Submissions NIPS*90 Local Committee
Department of Computer Science Engineering Center
Yale University University of Colorado
P.O. Box 2158 Yale Station Campus Box 425
New Haven, Conn. 06520 Boulder, CO 80309-0425
Organizing Committee:
General Chair: Richard Lippmann, MIT Lincoln Labs; Program Chair:
John Moody, Yale; Neurobiology Co-Chair: Terry Sejnowski, Salk;
Theory Co-Chair: Gerry Tesauro, IBM; Implementation Co-Chair:
Josh Alspector, Bellcore; Cognitive Science and AI Co-Chair:
Stephen Hanson, Siemens; Architectures Co-Chair: Yann Le Cun, ATT
Bell Labs; Applications Co-Chair: Lee Giles, NEC; Workshop Chair:
Alex Waibel, CMU; Workshop Local Arrangements, Howard Wachtel, U.
Colorado; Local Arrangements, Kathie Hibbard, U. Colorado;
Publicity: Stephen Hanson, Siemens; Publications: David
Touretzky, CMU; Neurosciences Liaison: James Bower, Caltech; IEEE
Liaison: Edward Posner, Caltech; APS Liaison: Larry Jackel, ATT
Bell Labs; Treasurer: Kristina Johnson, U. Colorado;
DEADLINE FOR SUMMARIES & ABSTRACTS IS MAY 17, 1990
please post
∂09-Feb-90 0929 LOGMTC-mailer Reminder: Concurrency Seminar
Received: from linz.stanford.edu by SAIL.Stanford.EDU with TCP; 9 Feb 90 09:29:46 PST
Received: by linz.stanford.edu (5.59/25-eef) id AA20150; Fri, 9 Feb 90 09:31:01 PDT
Message-Id: <9002091731.AA20150@linz.stanford.edu>
To: logmtc@sail
Subject: Reminder: Concurrency Seminar
Reply-To: tah@cs.stanford.edu
Date: 09 Feb 90 09:30:58 PST (Fri)
From: Tom Henzinger <tah@linz>
Friday, Feb. 9, 12:15, MJH 301 (note the change of room):
Rajeev Alur
Modeling and Verifying Real-time Systems
∂09-Feb-90 0949 chandler@Sunburn.Stanford.EDU ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : Belated Happy
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 09:48:54 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17135; Fri, 9 Feb 90 09:49:33 -0800
Date: Fri, 9 Feb 1990 9:49:33 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : Belated Happy
Birthday Party ]
Message-Id: <CMM.0.88.634585773.chandler@Sunburn.Stanford.EDU>
Faculty ... Come on down!
---------------
Return-Path: <chandler>
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16036; Fri, 9 Feb 90 09:05:34 -0800
Full-Name: Joyce R. Chandler
Date: Fri, 9 Feb 1990 9:05:33 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: mjhstaff@cs.Stanford.EDU
Subject: Belated Happy Birthday Party
Message-Id: <CMM.0.88.634583133.chandler@Sunburn.Stanford.EDU>
Because Nils "foiled" the plans for a birthday cake a couple of times already
due to his busy schedule, we're having a "belated" A.M. birthday gathering.
Come on by MJH-220 at 10:30 for a piece of "morning" birthday dessert and cup
of coffee, and an opportunity to wish him a happy "belated" birthday. See
you all at 10:30!!!!!
∂09-Feb-90 1022 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Defense Budget
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 10:22:41 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18195; Fri, 9 Feb 90 10:23:14 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA02873; Fri, 9 Feb 90 10:17:00 PST
Date: Fri, 9 Feb 90 10:17:00 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002091817.AA02873@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Defense Budget
You may be interested in the following data compiled
by Ray Perrault at SRI. --Nils
-------
Begin forwarded message:
Tue, 6 Feb 90 08:53:16 PST
Date: Tue 6 Feb 90 08:53:59-PST
From: PERRAULT@warbucks.ai.sri.com (Ray Perrault)
Subject: Defense Budget
To: aic-staff%ai.sri.com@warbucks.ai.sri.com, nielson@sri.com, kuo@sri.com,
moriconi@sri.com, dbell@sri.com, lmurphy@sri.com
Cc: eash@sri.com, perrault@warbucks.ai.sri.com
Mail-System-Version: <SUN-MM(229)+TOPSLIB(128)@ai.sri.com>
I had a quick look at the Bush Dod budget. Here are some highlights.
All figures in millions$.
FY90 FY91
---- ----
Total R&D 36,718 38,092 (+3.8%)
6.1 (Research) 923 978 (+6.0%)
6.2 (Expl. Dev) 2,403 2,457
Army 6.1 181 189
Navy 6.1 366 401
Air Force 6.1 190 201
Defense Agencies:
DMA 265 232
SDIO 3,571 4,460
OSD 1,032 1,054
DARPA 1,227 1,078 (and was 1,289 in FY89)
DNA 357 446
Def. Support Proj. Off. 123 225 (anyone know what this is?)
DCA 233 174
Def. Log. Agency 53 43
Spec. Ops Command 0 207 (War on Drugs?)
In OSD:
Comp. Aided Log. Support 13 14
DoD Software Init. 11 13
Joint Robotics Prog. 21.6 22
NATO R&D (Nunn) 116 96
The DARPA Budget has no breakdown by office:
Total 6.1 78 85 (was 89 in FY89)
Total 6.2 513 461 (was 620 in FY89)
--- ---
591 546 (-7.6%)
Sematech 100 100
Of course it's anyone's guess how these figures will compare to the
final thing.
Ray
p.s. I have a much more detailed document, courtesy of WDC office,
should you be interested.
-------
∂09-Feb-90 1024 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU You are invited....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 10:24:42 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17533; Fri, 9 Feb 90 10:02:15 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA14964; Fri, 9 Feb 90 10:01:46 -0800
Date: Fri, 9 Feb 1990 10:01:45 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: csdlist@cs.Stanford.EDU
Subject: You are invited....
Message-Id: <CMM.0.88.634586505.tajnai@Hudson.Stanford.EDU>
Faculty, Staff, Students, and Friends
of the
Computer Science Department
and the
Computer Systems Laboratory
are invited to
attend the
Stanford Computer Forum Reception
which closes our
Twenty-second Annual Conference
Faculty Club -- Red and Gold Lounges
Thursday, February 15, 1990
4:30 - 6:00pm
∂09-Feb-90 1115 wheaton@Sunburn.Stanford.EDU Announcement by the Provost
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 11:15:50 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19562; Fri, 9 Feb 90 11:16:13 -0800
Date: Fri, 9 Feb 90 11:16:13 -0800
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9002091916.AA19562@Sunburn.Stanford.EDU>
To: ac@sunburn.Stanford.EDU, staff@sunburn.Stanford.EDU
Subject: Announcement by the Provost
Dear CSD,
Yesterday afternoon Provost Jim Rosse announced to the Faculty Senate that
the University will take "some important steps to reduce Stanford's budget
and streamline its administrative operations". He has prepared a paper
defining the problem, identifying key elements in the repositioning effort,
and describing the process the University will follow in accomplishing its
objectives.
The paper, which is identical to the information released to the press, is
now in your mail box in MJH. It also will be distributed to everyone in
the University. The program and proposals outlined in the paper will
affect all of us, and I urge everyone to read it. Additional information
will be passed along as decisions are made, but, for now, this is as much
as any of us knows.
During yesterday's meeting, we were told that the news media probably would
publicize the most sensational parts of the release, and that's exactly
what has happened - the newspaper stories emphasized the possibility of
layoffs. While Rosse does consider that an option, it is only one part of
a much larger program.
In spite of a tight departmental budget this year, CSD is in good financial
shape, and we believe that we can absorb any reasonable university-mandated
budget reductions without layoffs. In any case, Stanford is now studying a
range of options, and specific actions won't be known for several weeks or
even months.
I know that some of us have been through these types of things before, and
there is a natural tendency to become anxious about job security. My
personal opinion is that it is too early for real concern. For now, 'wait
and see' is a reasonable approach.
George
∂09-Feb-90 1148 gilberts@Sunburn.Stanford.EDU Carpet Cleaners Tonight
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 11:48:12 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19856; Fri, 9 Feb 90 11:21:38 -0800
Date: Fri, 9 Feb 1990 11:21:37 GMT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Cc: Gilbertson@Sunburn.Stanford.EDU
Subject: Carpet Cleaners Tonight
Message-Id: <CMM.0.88.634591297.gilberts@Sunburn.Stanford.EDU>
CSD People:
Reminder....
The carpet cleaners will start this evening and work
through Saturday, in Bldg 460 - starting on the fourth
floor.
If you do not want your office carpet shampooed, please
put a large note on your door, and also let me know.
If you plan on having your rug cleaned, please move small
items on top of desks, etc. to help. You will want
to put special projects away, to prevent mishaps.
Many thanks for your cooperation.
-Edie
∂09-Feb-90 1347 chandler@Sunburn.Stanford.EDU Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 13:47:46 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13037; Fri, 9 Feb 90 13:48:34 -0800
Date: Fri, 9 Feb 1990 13:48:33 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg@hplabs.hp.com
Subject: Faculty Lunch
Message-Id: <CMM.0.88.634600113.chandler@Sunburn.Stanford.EDU>
Richard P. Brent (the Forsythe lecturer) will be our guest at next Tuesday's
faculty lunch. See you there!
∂09-Feb-90 1521 wheaton@Sunburn.Stanford.EDU Laura Pollock
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 15:18:20 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16309; Fri, 9 Feb 90 15:19:07 -0800
Date: Fri, 9 Feb 90 15:19:07 -0800
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9002092319.AA16309@Sunburn.Stanford.EDU>
To: ac@sunburn.Stanford.EDU, staff@sunburn.Stanford.EDU
Subject: Laura Pollock
On Monday, February 12, Laura Pollock will join CSD as Budget Officer.
Laura comes from H&S, where she has served in the Dean's office for five
years as Financial Administrator. She brings solid experience in
Stanford's financial and budgeting systems, as well as a thorough
understanding of faculty affairs.
Reporting to me, Laura will be responsible for CSD's operating budget and
unrestricted accounts. She also will maintain the faculty files.
She will move into Room 256 (next to Sharon Hemenway); I hope you will stop
by to introduce yourselves and welcome her to the department.
gw
∂09-Feb-90 1645 ingrid@russell.Stanford.EDU CSLI Colloquium, Thursday, 15 February, 4:15 p.m., Ventura 17
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 16:43:52 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA07711; Fri, 9 Feb 90 16:15:12 PST
Date: Fri, 9 Feb 90 16:15:12 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9002100015.AA07711@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Colloquium, Thursday, 15 February, 4:15 p.m., Ventura 17
CSLI COLLOQUIUM
Some Restructuring Effects in German
Jaklin Kornfilt
University of Syracuse
Thursday, 15 February, 4:15 p.m.
Ventura 17
Some recent work (e.g., Kayne, den Besten) has suggested that
Restructuring (or its equivalents, like multidimensional
representations) can be avoided by using mechanisms such as
Head-to-Head movement, Scrambling, etc. This paper looks at three
construction types in German, all of which involve apparent locality
violations, and argues that these constructions cannot be accounted
for by the proposed alternatives to Restructuring, in turn triggered
by Verb Raising. A treatment of Restructuring in terms of
morphologically derived and syntactically conflated categories (cf.
also recent work by Eric Reuland) will be explored.
The three construction types are illustrated by the following
examples:
A. Clitic Climbing:
(1) dass uns [1] der Hans vergessen hat [PRO e[1] sein Auto zu zeigen]
"that Hans has forgotten to show us his car"
B. "Long" Passives:
(2) dass das Auto [1] vergessen wurde [(PRO) e[1] zu reparieren]
"that it was forgotten to repair the car"
C. Preposed Verb Clusters
(3) [zu reparieren vergessen] hat der Hans das Auto nicht
"Hans hasn't forgotten to repair the car"
Finally, the question is addressed of why Subject Control verbs as
well as some Dative Control verbs allow Restructuring, while this is
never possible with Accusative Control verbs.
∂09-Feb-90 1916 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 19:15:54 PST
Received: by csli.Stanford.EDU (4.0/inc-1.0)
id AA26164; Fri, 9 Feb 90 19:06:38 PST
Date: Fri 9 Feb 90 19:06:37-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <634619197.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, February 15, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: John Lamping, Xerox PARC
Topic: "Why are Computer Programs so Complicated?"
ABSTRACT
--------
One reason for the complexity of computer programs is
that current programming languages don't allow programmers
to say what they mean. Rather than letting the programmer
say what a program is supposed to accomplish, the languages
force the programmer to give the computer a set of
instructions on what to do. The intent of the program is
relegated to the comments.
Functional programming and logic programming take a
step in the right direction, but a much smaller step than it
might first appear. While both approaches putatively let
the programmer specify what the program should compute, the
catch is that the way the programmer writes down the
specification completely determines how (and thus how
quickly) the computer will compute the result. To get
acceptable performance on anything but toy programs, the
description of the result usually must be contorted into
something that looks suspiciously like instructions on how
to compute the result. The intent of the program is still
relegated to the comments.
What if the description of what to compute could be
decoupled from how the result would be computed? It's a bit
much to expect a system that automatically figures out a
good way to compute a result, but that job can be left to
the programmer. The programmer would give a high level
description of what the result should be, and annotate that
description with instructions on how it should be
implemented.
In this talk, I'll give some examples of what this kind
of programming might look like and suggest how to build a
programming system that supports it. In such a system, the
programmer would talk explicitly about the representation
relationships within the program and between the program and
its implementation. The key to designing such a system
seems to be a good theoretical understanding of such
representation relationships.
Following week, February 22:
Phil Cohen, Linguistics, SRI International
"Intention, Commitment, and Communication"
-------
∂09-Feb-90 2041 manning@sierra.STANFORD.EDU Quals result reviews
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 9 Feb 90 20:41:54 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Fri, 9 Feb 90 20:38:59 PST
Date: Fri, 9 Feb 90 20:38:59 PST
From: manning@sierra.STANFORD.EDU (Laurence A. Manning)
To: ee-faculty@sierra.STANFORD.EDU
Subject: Quals result reviews
Message-Id: <CMM.0.88.634624738.manning@>
The deadline for submitting petitions to the Qualifying Examination
Review Committee is February 15. Students who have taken the Quals
two or more times may appeal with faculty support. Students who have
taken the Quals the first time can not appeal themselves, but a
faculty member can petition on their behalf. Diane Shankle has two
types of petition forms in the EE office to cover these two cases.
They give fuller instructions, and should be used in conjunction
with a supporting faculty letter, and such other materials as may
be pertinent. All material must be in to Diane by the 15'th (Friday).
Larry Manning
∂10-Feb-90 0352 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Advance Program: Computational Geometry Conference, Berkeley,
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Feb 90 03:52:37 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02605; Sat, 10 Feb 90 03:52:57 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21826; Sat, 10 Feb 90 03:52:43 -0800
Message-Id: <9002101152.AA21826@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3156; Sat, 10 Feb 90 05:13:19 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3088; Sat, 10 Feb 90 05:13:15 CST
Date: Fri, 9 Feb 90 04:36:11 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
yao.pa@Xerox.COM
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: yao.pa%Xerox.COM@VM1.NoDak.EDU
Subject: Advance Program: Computational Geometry Conference, Berkeley,
June 6-8
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Here is the preliminary version of the technical program.
---------------------------
The Sixth Annual Symposium on Computational Geometry
June 6-8, 1990
Clark Kerr Campus
University of California
Berkeley, California
Wednesday Morning, June 6
Session 1: 8:40-10:00 am
Chair: Frances Yao, Xerox PARC
8:40
Cutting Hyperplane Arrangements
Jiri Matousek,
Charles University, Czechoslovakia
9:00
Some New Bounds for Epsilon-NetsJanos Pach, New York University and
Hungarian Academy of Sciences,
Gerhard Woeginger,
Technische Universitat Graz
9:20
How to Net a Lot with Little: Small Epsilon-nets for Disks and Halfspaces
Jiri Matousek,
Charles University,
Raimund Seidel,
UC Berkeley,
Emo Welzl,
Freie Universitat Berlin
9:40
Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone
Theorems
Bernard Chazelle,
Princeton University,
Micha Sharir, New York University and
Tel Aviv University
Coffee Break 10:00-10:20 am
Session 2: 10:20 am-12:00 pm
Chair: Mikhail Atallah, Purdue University
10:20
O (n log log n) Polygon Triangulation With Simple Data Structures
David G. Kirkpatrick and Maria M. Klawe, University of British Columbia,
Robert E. Tarjan,
Princeton University
10:40
A Polynomial Time Algorithm for the MinMax Angle Triangulation
Herbert Edelsbrunner and Tiow Seng Tan, University of Illinois
11:00
Structured Visibility Profiles with Applications
to Problems in Simple Polygons
Paul J. Heffernan and Joseph S. B. Mitchell,
Cornell University
11:20
Computing the Minimum Link Path Among a Set of Obstacles in the Plane
Joseph S. B. Mitchell,
Cornell University, Gunter Rote and Gerhard Woeginger,
Technische Universitat Graz
11:40
Parallel Methods for Visibility and Shortest Path Problems in Simple
Polygons
Michael T. Goodrich,
The Johns Hopkins University,
Steven B. Shauck,
Westinghouse Electric Corporation,
Sumanta Guha,
University of Michigan
Lunch Break 12:00-1:30 pm
Wednesday Afternoon, June 6
Session 3: Invited Lecture
1:30
Differential Geometry and Computation
S. S. Chern, University of California, Berkeley
Session 4: 2:30-3:30 pm
Chair: Ronald Graham, AT&T Bell Laboratories
2:30
On the Combinatorial Complexity of Hyperplane Transversals
Sylvain E. Cappell, New York University, Jacob E.Goodman,
The City University of New York, Janos Pach, New York University and
Hungarian Academy of Sciences,
Richard Pollack,
New York University,
Micha Sharir,
New York University and
Tel Aviv University, Rephael Wenger, DIMACS Center
2:50
On the Limited Abilities of Ray-Oracles
Peter Gritzmann, University of Augsburg and University of Washington,
Victor Klee and John Westwater,
University of Washington
3:10
Computational Complexity of Combinatorial Surfaces
Gert Vegter,
University of Groningen,
The Netherlands,
Chee K. Yap,
New York University
Coffee Break 3:30-3:50 pm
Session 5: 3:50-5:10 pm
Chair: Tetsuo Asano, Osaka Electro-Communication University
3:50
Points and Triangles in the Plane and Halving Planes in Space
Bernard Chazelle, Princeton University,
Herbert Edelsbrunner, Univeristy of Illinois,
Leonidas J. Guibas, DEC SRC and Stanford University,
Micha Sharir, New York University and Tel Aviv University
4:10
Selecting Multiply Covered Points and Reducing the Size of
Delaunay Triangulations
Bernard Chazelle, Princeton University,
Herbert Edelsbrunner, University of Illinois,
Leonidas J. Guibas, DEC SRC and Stanford University,
John E. Hershberger, DEC SRC,
Raimund Seidel, UC Berkeley,
Micha Sharir, New York University and Tel Aviv University
4:30
Tiling the Plane with One Tile
Daniele Beauquier and Maurice Nivat,
LITP Universite Paris VI et VII
4:50
A Trivial Knot Whose Spanning Disks Have Exponential Size
Jack Snoeyink,
Stanford University
Thursday Morning, June 7
Session 6: Invited Lecture
9:00
The Demands on Computational Geometry Made by Image Rendering
James F. Blinn, California Institute of Technology
Session 7: 10:00 am-12:00 pm
Chair: David Dobkin, Princeton University
10:00
Geometric Computations with Algebraic Varieties of Bounded Degree
Chanderjit Bajaj,
Purdue University
10:20
On Computing the Intersection of B-Splines
B. K. Natarajan,
Carnegie Mellon University and Hewlett-Packard Laboratories
Coffee Break 10:40--11:00 am
11:00
Merging Visibility Maps
Mark H. Overmars, Utrecht University,
Micha Sharir, New York University and Tel Aviv University
11:20
Stabbing and Ray Shooting in 3 Dimensional Space
Marco Pellegrini, New York University
11:40
K-d Trees for Semidynamic Point Sets
Jon Bentley, AT&T Bell Laboratories
Lunch Break 12:00-1:30 pm
Thursday Afternoon, June 7
Session 8: 1:30-3:10 pm
Chair: Pravin Vaidya, University of Illinois
1:30
On the Optimal Bisection of a Polygon
Elias Koutsoupias and Christos H. Papadimitriou, UC San Diego,
Martha Sideri, Computer Technology Institute, Greece
1:50
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs
Pankaj Agarwal,
DIMACS Center and Duke University,
Herbert Edelsbrunner, University of Illinois,
Otfried Schwarzkopf and Emo Welzl,
Freie Universitat Berlin
2:10
Linear Programming and Convex Hulls Made Easy
Raimund Seidel,
University of California, Berkeley
2:30
On Simultaneous Inner and Outer Approximation of Shapes
Rudolf Fleischer and Kurt Mehlhorn,
Universitat des Saarlandes,
Gunter Rote, Technische Universitat Graz,
Emo Welzl,
Freie Universitat Berlin, Chee Yap,
New York University
2:50
Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi
Diagrams
Hiromi Aonuma and Hiroshi Imai,
Kyushu University, Keiko Imai,
Kyushu Institute of Technology,
Takeshi Tokuyama, IBM Tokyo Research Laboratory
Coffee Break 3:10-3:30 pm
Session 9: 3:30-4:50 pm
Chair: Steve Fortune, AT&T Bell Laboratories
3:30
Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic
Victor Milenkovic and Zhenyu Li,
Harvard University
3:50
Finding Compact Coordinate Representations for Polygons and Polyhedra
Victor Milenkovic,
Harvard University,
Lee R. Nackman,
IBM Thomas J. Watson Research Center
4:10
Some Provably Hard Crossing Number Problems
Daniel Bienstock,
Columbia University
4:30
Enumeration and Visibility Problems in Integer Lattices
Evangelos Kranakis,
Centre for Mathematics and Computer Science, The Netherlands, Michel
Pocchiola,
Ecole Normale Superieure, France
Friday Morning, June 8
Session 10: Invited Lecture
9:00
Implementing Projective Geometry via Symbolic Computation
Dana S. Scott,
Carnegie Mellon University
Session 11: 10:00 am-12:00 pm
Chair: Mikhail Atallah, Purdue University
10:00
An Exact Algorithm for Kinodynamic Planning in the Plane
John Canny and Ashutosh Rege, University of California, Berkeley,
John Reif, Duke University
10:20
Approximate Motion Planning and the Complexity of the Boundary of the Union
of Simple Geometric Figures
Helmut Alt, Freie Universitat Berlin, Rudolf Fleischer, Michael Kaufmann,
Kurt Mehlhorn, Stefan Naher, Stefan Schirra and Christian Uhrig,
Universitat des Saarlandes
Coffee Break 10:40 am-11:00 am
11:00
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for
Cartesian Robots and Open Chain Manipulators
Bruce Donald and Patrick Xavier, Cornell University
11:20
Shortest Rectilinear Paths Among Weighted Obstacles
C. D. Yang, T. H. Chen and D.T. Lee, Northwestern University
11:40
On Minimal Rectilinear Steiner Trees in All Dimensions
Timothy L. Snyder,
Georgetown University
Lunch Break 12:00-1:30 pm
Friday Afternoon, June 8
Session 12: 1:30-3:10 pm
Chair: Marshall Bern, Xerox PARC
1:30
Selecting Distances in the Plane
Pankaj K. Agarwal,
DIMACS Center and Duke University,
Boris Aronov,
DIMACS Center, Micha Sharir, New York University and
Tel Aviv University, Subhash Suri,
Bellcore
1:50
Reconstructing Sets from Interpoint Distances
Steven Skiena,
SUNY at Stony Brook,
Warren D. Smith,
AT&T Bell Laboratories,
Paul Lemke,
Rensselaer Polytechnic Institute
2:10
Computing the Minimum Hausdorff Distance for Point Sets Under Translation
Dan P. Huttenlocher,
Cornell University,
Klara Kedem,
Tel Aviv University
2:30
On Solving Geometric Optimization Problems Using Shortest Paths
Elefterios A. Melissaratos
and Diane L. Souvaine,
Rutgers University
2:50
Shortest Paths on a Polyhedron
Jindong Chen and Yijie Han,
University of Kentucky
∂10-Feb-90 0738 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Structures Conference Preliminary Program
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Feb 90 07:38:12 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04626; Sat, 10 Feb 90 07:38:53 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22407; Sat, 10 Feb 90 07:33:34 -0800
Message-Id: <9002101533.AA22407@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0622; Sat, 10 Feb 90 09:28:47 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0550; Sat, 10 Feb 90 09:28:43 CST
Date: Fri, 9 Feb 90 09:47:35 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
alan selman <selman@dara350j.ccs.northeastern.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: alan selman <selman%dara350j.ccs.northeastern.edu@VM1.NoDak.EDU>
Subject: Structures Conference Preliminary Program
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Preliminary Program
Fifth Annual Structure in Complexity Theory Conference
8-11 July 1990,
Universitat Polit\`ecnica de Catalunya,
Barcelona, Spain
Note: Informal Rump Sessions will be scheduled at the end of each
day's formal session.
Sunday, July 8, Morning
Chair: Alan Selman, Northeastern University
8:45-9:30 On Polynomial Bounded Truth-Table Reducibility of NP Sets
to Sparse Sets,M. Ogiwara and O. Watanabe,
Tokyo Institute of Technology
9:40-10:25 Structural Properties of Nondeterministic Complete Sets,
S. Homer, Boston University
10:25-10:55 Break
10:55-11:25 On Sets with Efficient Implicit Membership Tests,
L. Hemachandra, University of Rochester, A.Hoene,Technische
Universit\"at Berlin,
11:30-12:00 On the Instance Complexity of NP-Hard Problems,
P. Orponen, University of Toronto and University of
Helsinki
Sunday, July 8, Afternoon.
Chair: Peter Clote, Boston College
1:30-2:15 Email and the Unexpected Power of Interaction (Tentative),
L. Babai, University of Chicago and Eotvos University
2:25-2:55 On Bounded Round Multi-Prover Interactive Proof Systems,
J. Cai, L. Lipton, Princeton University, A. Condon, University of
Wisconsin-Madison
3:00-3:30 Privacy, Additional Information, and Communication,
R. Bar-Yehuda, B. Chor, E. Kushilevitz, Technion
3:30-4:00 Break
4:00-4:30 On the Power of Randomness in the Decision Tree Model,
P. Hajnal, Princeton University and University of Szeged
4:35-5:05 On Read-Once Threshold Formulae
and their Randomized Decision Tree Complexity,
R. Heiman, Weizmann Institute, I. Newman, A. Wigderson,
Hebrew University
Monday, July 9, Morning
Chair: L\'aszl\'o Babai, University of Chicago and Eotvos
University
8:45-9:30 The Computational Complexity of Universal Hashing,
Y. Mansour, N. Nisan, M.I.T., P. Tiwari, IBM T.J. Watson
Research Center
9:40-10:25 Perfect Hashing, Graph Entropy, and Circuit Complexity,
I. Newman, A. Wigderson, Hebrew University,
P. Ragde, University of Waterloo
10:25-10:55 Break
10:55-11:25 Lower Bounds on Random-Self-Reducibility,
J. Feigenbaum, AT\&T Bell Laboratories, S. Kannan,
University of California-Berkeley, N. Nisan, M.I.T.
11:30-12:00 Non-Uniform Complexity Classes and Random Languages,
M. Mundhenk, Universit\"at Ulm, R. Schuler, U. Koblenz
Monday, July 8, Afternoon
Chair: Steven Homer, Boston University
1:30-2:15 Circuit Size Relative to Pseudorandom Oracles,
J. Lutz, W. Schmidt, Iowa State University
2:25-2:45 A Note on Relativizing Complexity
Classes with Tally Oracles,
L. Hemachandra, University of Rochester, R. Rubinstein,
Worcester Polytechnic Institute
2:50-3-20 An Oracle Separating \oplus P from PP(PH),
F. Green, Clark University
3:20-3:50 Break
3:50-4:20 On Separating Complexity Classes,
R. Book, University of California-Santa Barbara
4:25-4:55 Complexity Classes with Advice,
J. K\"obler, T. Thierauf, Universit\"at Ulm
Tuesday, July 10, Morning
Chair: Walter L. Ruzzo, University of Washington
8:45-9:30 A Survey of Counting Classes,
G. Wechsung, Friedrich-Schiller Universit\"at
9:40-10:25 A Very Hard Log Space Counting Class,
C. \`Alvarez, Universitat Polit\`ecnica de Catalunya,
B. Jenner, Universit\"at Hamburg
10:25-10:55 Break
10:55-11:25 The Boolean Hierarchy and the Polynomial Hierarchy:
A Closer Connection,
R. Chang, Cornell University, J. Kadin, University of Maine
11:30-12:00 On Read-Once vs. Multiple Access to Randomness in Logspace,
N. Nisan, M.I.T.
Tuesday, July 10, Afternoon
Chair: Gerd Wechsung, Friedrich-Schiller Universit\"at
1:30-2:15 Bounded Arithmetic and Complexity,
P. Clote, Boston College
2:25-2:55 Extensions to Barrington's M-Program Model,
F. B\'edard, F. Lemieux, P. McKenzie, Universit\'e de
Montr\'eal
3:00-3:30 The Quantifier Structure of Sentences that Characterize
Nondeterministic Time Complexity,
J. Lynch, Clarkson University
3:30-4:00 Break
4:00-4:30 Circuits, Pebbling, and Expressibility,
E. Vinay, C. Madhaven, Indian Institute of Science,
H. Venkateswaran, Georgia Institute of Technology
Wednesday, July 11, Morning
Chair: Dexter Kozen, Cornell University
8:45-9:30 Cheatable, P-Terse, and P-Superterse Sets,
A. Amir, W. Gasarch, University of Maryland, R. Beigel, Yale
University
9:40-10:25 Quantifiers and Approximation,
A. Panconesi, D. Ranjan, Cornell University
10:25-10:55 Break
10:55-11:25 Impossibilities and Possibilities
of Weak Separation Between NP and Exponential Time,
G. Lischke, Friedrich-Schiller Universit\"at
11:30-12:00 P-Productivity and Polynomial Time Approximations,
J. Wang, Boston University
Wednesday, July 11, Afternoon
Chair: Stuart Kurtz, University of Chicago
1:30-2:15 Title to be Announced (Tentative),
W. Ruzzo, University of Washington
2:25-2:45 Width-Bounded Reducibility and Binary Search over
Complexity Classes, E. Allender, Rutgers University,
C. Wilson, University of Oregon
2:50-3:20 Unambiguity of Circuits, K. Lange, Technische Universit\"at
M\"unchen
If you would like a latex source version of this announcement
please send a message to selman@corwin.ccs.northeastern.edu
∂11-Feb-90 0332 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Structures Conference Preliminary Program
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Feb 90 03:32:08 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15913; Sun, 11 Feb 90 03:32:37 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26426; Sun, 11 Feb 90 03:29:46 -0800
Message-Id: <9002111129.AA26426@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3424; Sun, 11 Feb 90 05:25:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3397; Sun, 11 Feb 90 05:25:36 CST
Date: Sat, 10 Feb 90 12:26:59 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
alan selman <selman@dara350j.ccs.northeastern.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: alan selman <selman%dara350j.ccs.northeastern.edu@VM1.NoDak.EDU>
Subject: Structures Conference Preliminary Program
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Preliminary Program
Fifth Annual Structure in Complexity Theory Conference
8-11 July 1990,
Universitat Polit\`ecnica de Catalunya,
Barcelona, Spain
Note: Informal Rump Sessions will be scheduled at the end of each
day's formal session.
Sunday, July 8, Morning
Chair: Alan Selman, Northeastern University
8:45-9:30 On Polynomial Bounded Truth-Table Reducibility of NP Sets
to Sparse Sets,M. Ogiwara and O. Watanabe,
Tokyo Institute of Technology
9:40-10:25 Structural Properties of Nondeterministic Complete Sets,
S. Homer, Boston University
10:25-10:55 Break
10:55-11:25 On Sets with Efficient Implicit Membership Tests,
L. Hemachandra, University of Rochester, A.Hoene,Technische
Universit\"at Berlin,
11:30-12:00 On the Instance Complexity of NP-Hard Problems,
P. Orponen, University of Toronto and University of
Helsinki
Sunday, July 8, Afternoon.
Chair: Peter Clote, Boston College
1:30-2:15 Email and the Unexpected Power of Interaction (Tentative),
L. Babai, University of Chicago and Eotvos University
2:25-2:55 On Bounded Round Multi-Prover Interactive Proof Systems,
J. Cai, L. Lipton, Princeton University, A. Condon, University of
Wisconsin-Madison
3:00-3:30 Privacy, Additional Information, and Communication,
R. Bar-Yehuda, B. Chor, E. Kushilevitz, Technion
3:30-4:00 Break
4:00-4:30 On the Power of Randomness in the Decision Tree Model,
P. Hajnal, Princeton University and University of Szeged
4:35-5:05 On Read-Once Threshold Formulae
and their Randomized Decision Tree Complexity,
R. Heiman, Weizmann Institute, I. Newman, A. Wigderson,
Hebrew University
Monday, July 9, Morning
Chair: L\'aszl\'o Babai, University of Chicago and Eotvos
University
8:45-9:30 The Computational Complexity of Universal Hashing,
Y. Mansour, N. Nisan, M.I.T., P. Tiwari, IBM T.J. Watson
Research Center
9:40-10:25 Perfect Hashing, Graph Entropy, and Circuit Complexity,
I. Newman, A. Wigderson, Hebrew University,
P. Ragde, University of Waterloo
10:25-10:55 Break
10:55-11:25 Lower Bounds on Random-Self-Reducibility,
J. Feigenbaum, AT\&T Bell Laboratories, S. Kannan,
University of California-Berkeley, N. Nisan, M.I.T.
11:30-12:00 Non-Uniform Complexity Classes and Random Languages,
M. Mundhenk, Universit\"at Ulm, R. Schuler, U. Koblenz
Monday, July 8, Afternoon
Chair: Steven Homer, Boston University
1:30-2:15 Circuit Size Relative to Pseudorandom Oracles,
J. Lutz, W. Schmidt, Iowa State University
2:25-2:45 A Note on Relativizing Complexity
Classes with Tally Oracles,
L. Hemachandra, University of Rochester, R. Rubinstein,
Worcester Polytechnic Institute
2:50-3-20 An Oracle Separating \oplus P from PP(PH),
F. Green, Clark University
3:20-3:50 Break
3:50-4:20 On Separating Complexity Classes,
R. Book, University of California-Santa Barbara
4:25-4:55 Complexity Classes with Advice,
J. K\"obler, T. Thierauf, Universit\"at Ulm
Tuesday, July 10, Morning
Chair: Walter L. Ruzzo, University of Washington
8:45-9:30 A Survey of Counting Classes,
G. Wechsung, Friedrich-Schiller Universit\"at
9:40-10:25 A Very Hard Log Space Counting Class,
C. \`Alvarez, Universitat Polit\`ecnica de Catalunya,
B. Jenner, Universit\"at Hamburg
10:25-10:55 Break
10:55-11:25 The Boolean Hierarchy and the Polynomial Hierarchy:
A Closer Connection,
R. Chang, Cornell University, J. Kadin, University of Maine
11:30-12:00 On Read-Once vs. Multiple Access to Randomness in Logspace,
N. Nisan, M.I.T.
Tuesday, July 10, Afternoon
Chair: Gerd Wechsung, Friedrich-Schiller Universit\"at
1:30-2:15 Bounded Arithmetic and Complexity,
P. Clote, Boston College
2:25-2:55 Extensions to Barrington's M-Program Model,
F. B\'edard, F. Lemieux, P. McKenzie, Universit\'e de
Montr\'eal
3:00-3:30 The Quantifier Structure of Sentences that Characterize
Nondeterministic Time Complexity,
J. Lynch, Clarkson University
3:30-4:00 Break
4:00-4:30 Circuits, Pebbling, and Expressibility,
E. Vinay, C. Madhaven, Indian Institute of Science,
H. Venkateswaran, Georgia Institute of Technology
Wednesday, July 11, Morning
Chair: Dexter Kozen, Cornell University
8:45-9:30 Cheatable, P-Terse, and P-Superterse Sets,
A. Amir, W. Gasarch, University of Maryland, R. Beigel, Yale
University
9:40-10:25 Quantifiers and Approximation,
A. Panconesi, D. Ranjan, Cornell University
10:25-10:55 Break
10:55-11:25 Impossibilities and Possibilities
of Weak Separation Between NP and Exponential Time,
G. Lischke, Friedrich-Schiller Universit\"at
11:30-12:00 P-Productivity and Polynomial Time Approximations,
J. Wang, Boston University
Wednesday, July 11, Afternoon
Chair: Stuart Kurtz, University of Chicago
1:30-2:15 Title to be Announced (Tentative),
W. Ruzzo, University of Washington
2:25-2:45 Width-Bounded Reducibility and Binary Search over
Complexity Classes, E. Allender, Rutgers University,
C. Wilson, University of Oregon
2:50-3:20 Unambiguity of Circuits, K. Lange, Technische Universit\"at
M\"unchen
If you would like a latex source version of this announcement
please send a message to selman@corwin.ccs.northeastern.edu
∂11-Feb-90 2153 LOGMTC-mailer Gilmore talk
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Feb 90 21:53:22 PST
Received: from localhost by russell.Stanford.EDU (4.0/inc-1.0)
id AA03623; Sun, 11 Feb 90 21:56:17 PST
Message-Id: <9002120556.AA03623@russell.Stanford.EDU>
To: logic@russell.Stanford.EDU
Subject: Gilmore talk
Date: Sun, 11 Feb 90 21:56:15 PST
From: John Etchemendy <etch@russell.Stanford.EDU>
Philosophy 396
Seminar on Issues in Logical Theory
February 15, 3:45 pm
Cordura 100
Speaker: Prof. Paul C. Gilmore
Prof. of Computer Science
U.British Columbia
Title: How many real numbers are there?
Abstract:
In this lecture a natural deduction based set theory NaDSet will be
used to provide a formal framework for logical foundations of category
theory admitting genuine instances of self-membership. However, usual
diagonal arguments leading to inconsistency are blocked, including
Cantor's argument for uncountability of the set of real numbers.
∂12-Feb-90 0948 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU PODS-SIGMOD PROPOSAL
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 09:47:54 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13483; Mon, 12 Feb 90 09:48:24 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16131; Mon, 12 Feb 90 09:45:34 -0800
Message-Id: <9002121745.AA16131@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8493; Mon, 12 Feb 90 11:42:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8483; Mon, 12 Feb 90 11:42:35 CST
Date: Mon, 12 Feb 90 11:40:51 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
THEORYNT@YKTVMX.Stanford.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: THEORYNT%YKTVMX.BITNET@VM1.NoDak.EDU
Subject: PODS-SIGMOD PROPOSAL
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The field of databases has accomplished much during the past two
decades, providing technology for addressing important real-world
problems and establishing itself as a discipline in computer science.
Just as relational databases became a reality, research into the
next-generation database technology began, spawning a number of
subfields of research, including engineering and design databases,
temporal databases, multimedia databases, deductive databases, real-time
databases, extensible databases, object-oriented databases, etc.
In the view of many database professionals, one of the disappointments
the field of databases has suffered during the past several years is the
lack of synergy between database theorists and systems people.
Systems people have used such conferences as SIGMOD and VLDB as
their forum, while theorists have used PODS as their forum; each camp
has shied away from the other camp's forum.
The subfields of database research pose many problems that require
theorists and systems people to address together in order to make the
next-generation database technology a reality sooner. Ideally, the
systems people should define the problems and offer initial solutions;
the theorists should establish rigorous foundations to the problems,
and offer solutions that satisfy real-world constraints to varying
degrees.
This is a proposal to provide a common forum for exchanges of problems
and solutions in various subfields of database research among database
theorists and systems people.
The following are the principal elements of this proposal.
1. The SIGMOD and PODS conferences will be held at the same time and
place as essentially independent conferences
during the same two and one half day period (or three day period).
There will be however several common sessions (e.g., keynote lectures and
panels) that should be of interest to both camps.
2. There will be one organizing committee, but two independent
program committees for the two conferences.
The organizing committee will consist of representatives from
both SIGMOD and PODS. There will be a single local arrangement
chair for the joint conference.
3. All nontechnical programs, including lunches and the banquet, will be
held jointly (i.e., as if it were a single conference).
4. Both the SIGMOD and SIGACT mailing lists will be used for the call for
papers and advance program announcements.
5. SIGMOD will take the fiscal responsibilities for the joint
conference. In particular, there will be a single registration for the
joint conference. There will be two separate proceedings: one
for SIGMOD and one for PODS. Each person registering for the conference
will will receive both proceedings. The profits/losses from the sale of
the PODS proceedings will be split evenly among SIGMOD, SIGACT, and
SIGART, the three SIGs which have co-sponsored PODS in the past.
6. We will try this arrangement for two years, beginning in 1991 in
Boulder, Colorado. The plans for the SIGMOD `91 (site, PC and general
chairs) were firmed up about six months ago.
7. The dates for the combined conference will always be chosen so as
not to conflict with the STOC dates.
8. If, after trying for two years, the sentiment among the
participants indicates that the cultural gap between the two camps is
simply too wide to bridge, then SIGMOD and PODS will go their separate
ways, whatever the future holds for them.
Comments on this proposal are very welcome. The proposal will be
discussed and voted on in the business meeting of the next PODS
meeting (Nashville, Tennessee, April 2-4, 1990).
Avi Silberschatz (avi@cs.utexas.edu)
Won Kim (kim@mcc.com)
∂12-Feb-90 0955 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU PRG and lambda calculus
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 09:55:35 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA14005; Mon, 12 Feb 90 09:55:54 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16549; Mon, 12 Feb 90 09:54:32 -0800
Message-Id: <9002121754.AA16549@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8952; Mon, 12 Feb 90 11:52:53 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8931; Mon, 12 Feb 90 11:52:49 CST
Date: Mon, 12 Feb 90 11:51:23 CST
Reply-To: sreedhar%longhair.cs.unlv.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: sreedhar%longhair.cs.unlv.edu@VM1.NoDak.EDU
Subject: PRG and lambda calculus
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
address: 4505, Maryland parkway, Dept. of Computer Science,
University of Neavada, Las Vegas, NV 89154, USA
Thank you everybody for responding to my request. I tried to
mail the list of reference, but many of the emails bounced
back. So now I am posting the same. I am listing only those
articles I read. Listings are in bibtex (under latex) format.
---------------------------------------------------
@BOOK{field:func,
author = "A. J. Field and P. G. Harrison",
title = "{F}unctional {P}rogramming",
publisher = "Addison-wesley Publishing Company",
year = "1988",
address = " ",
note ="\newline A{n} excellent book. Subject is introduced using {HOPE}
language. Gives a good treatment on graph reduction and optimization",
}
@BOOK{peyton:implement,
author = "S. Peyton-Jones",
title = "The Implementation of Functional Programming Languages",
publisher = "Prentice-Hall International",
year = "1987",
address = "Englewood Cliffs, NJ",
note = "\newline An excellent book. Gives details of implementation using
{M}iranda language. A very good reference for compiler writing using graph
reduction",
}
@BOOK{barendregt:lambda,
author = "H. P. Barendregt",
title = "The Lambda Calculus - its syntax and semantics",
publisher = "North Holland",
year = "1981",
}
@BOOK{ curry:combinatory,
author = "H. B. Curry and R. Feys",
title = "Combinatory logic",
volume = "1",
publisher = "North Holland",
year = "1958",
}
@BOOK{hindley:introd,
author = "J. R. Hindley and J. P. Seldin",
title = "Introduction to combinators and $\lambda$-calculus",
publisher = "Cambridge University Press",
year = "1986",
}
@BOOK{seldin:curry,
editor = "J. P. Seldin and J. R. Hindley",
title = "To {H. B. Curry}: {Essays} on Combinatory logic, Lambda
Calculus, and Formalism",
publisher = " Academic Press",
year = "1980",
}
@incollection{turner:miranda,
author = "D. A. Turner",
title = "Miranda: A non-strict functional language with polymorphic types",
editor = "G. Goos and J. Hartmanis",
booktitle = "Functional Proagramming and Computer Architecture",
series = "LNCS",
Volume = "201",
year = "1985",
publisher = "Springer-Verlag",
}
@incollection{hudak:serial,
author = "P. Hudak and B. Goldberg",
title = "Serial Combinators: Optimal Grains of Parallelism",
editor = "G. Goos and J. Hartmanis",
booktitle = "Functional Proagramming and Computer Architecture",
series = "LNCS",
Volume = "201",
year = "1985",
publisher = "Springer-Verlag",
}
@INPROCEEDINGS{hankin:safe,
author = "C. L. Hankin and G. L. Burn and S. L. Peyton-Jones",
editor = "G. Goos and J. Hartmanis",
title = "A Safe Approach to Parallel Combinator Reduction ",
booktitle = "{ESOP} 86: European Symposium on Programming",
publisher = "Springer-Verlag",
volume = "213",
series = "LNCS",
pages = "99-109",
year = "1986",
month = "March",
address = "Saarbrucken, FRG",
}
@INPROCEEDINGS{bellot:graal,
author = "P. Bellot",
editor = "G. Goos and J. Hartmanis",
title = " {GRAAL}: A Functional Programming System with Uncurrified
Combinators and its Reduction Machine",
booktitle = "{ESOP} 86: European Symposium on Programming",
publisher = "Springer-Verlag",
volume = "213",
series = "LNCS",
pages = "82-98",
year = "1986",
month = "March",
address = "Saarbrucken, FRG",
}
@INCOLLECTION{nokel:remarks,
author = "K. Nokel and R. Rehbol and M. M. Richter",
editor = "G. Goos and J. Hartmanis",
title = " Remarks on {SASL} and the Verification of Functional Programming
Langauges",
booktitle = "Computation Theory and Logic",
publisher = "Springer-Verlag",
volume = "270",
series = "LNCS",
pages = "265-276",
year = "1987",
}
@INPROCEEDINGS{lamping:algorithm,
author = "J. Lamping",
booktitle = "Proceedings of Principles of Programming Languages",
title = "An Algorithm for Optimal Lambda Calculus Reduction",
year = "1990",
month = "January",
publisher = "ACM Press",
organization = "ACM",
note = "\newline Gives an algorithm to implement an optimal lambda calculus
reduction based on {Levy's} definition. The author gives a set of graph
rewriting rules to reduce the lambda expression using graph techniques.",
}
@INPROCEEDINGS{hudak:experiment,
author = "P. Hudak and B. Goldberg ",
title = "Experiments in Diffused Combinator Reduction",
booktitle = "ACM Symposium on Lisp and Functional Programming",
year = "1984",
month = "August",
publisher = "ACM Press",
organization = "ACM",
address = "Texas",
pages = "167-176",
}
@INPROCEEDINGS{rosser:highlights,
author ="J. B. Rosser",
title = "Highlights of the history of lambda-calculus",
booktitle = "ACM Symposium on Lisp and Functional Programming",
year = "1982",
month = "August",
publisher = "ACM Press",
organization = "ACM",
address = "Pennysylvania",
pages = "216-225",
}
@INPROCEEDINGS{kennaway:expression,
author ="J. R. Kennaway and M. R. Sleep",
title = "Expression as Processes",
booktitle = "ACM Symposium on Lisp and Functional Programming",
year = "1982",
month = "August",
publisher = "ACM Press",
organization = "ACM",
address = "Pennysylvania",
pages = "21-28",
}
@INPROCEEDINGS{jones:fixed,
author ="N. D. Jones and S. S. Muchnick",
title = "A Fixed-Program Machine for Combinator Expression Evaluation",
booktitle = "ACM Symposium on Lisp and Functional Programming",
year = "1982",
month = "August",
publisher = "ACM Press",
organization = "ACM",
address = "Pennysylvania",
pages = "11-20",
}
@article{johnsson:efficient,
author ="T. Johnsson",
title = "Efficient Compilation of Lazy Evaluation",
booktitle = "Proceedings of the ACM SIGPLAN'84 Symposium on Compiler
Construction",
journal = " SIGPLAN Notices",
year = "1984",
month = "June",
volume = "19",
number = "6",
publisher = "ACM Press",
organization = "ACM",
Pages = "58-69",
}
@INPROCEEDINGS{hindley:combinators,
author ="J. R. Hindley",
editor = "G. Cousineau et al",
title = "Cominators and Lambda-calculus, a short outline",
booktitle = "Combinators and Functional Programming Languages - 13th Spring
School of the LITP Proceedings",
year = "1985",
month = "May",
publisher = "Springer-Verlag",
series = "LNCS",
volume = "242",
address = "France",
}
@INPROCEEDINGS{peyton:intro,
author ="S. L. Peyton-Jones",
editor = "G. Cousineau et al",
title = "An introduction to fully-lazy supercombinators",
booktitle = "Combinators and Functional Programming Languages - 13th Spring
School of the LITP Proceedings",
year = "1985",
month = "May",
publisher = "Springer-Verlag",
series = "LNCS",
volume = "242",
address = "France",
}
@INPROCEEDINGS{harrison:parallel,
title = "The Parallel Graph Reduction Machine, {ALICE}",
editor = "J. H. Fasel and R. M. Keller",
author = "P. G. Harrison and M. J. Reeve",
booktitle = "Graph Reduction - Proceedings of a Workshop",
year = "1986",
month = "September/October",
publisher = "Springer-Verlag",
series = "LNCS",
volume = "279",
address = "New Mexico",
page = "181-202",
}
@INPROCEEDINGS{oberhauser:onthe,
author = "H. Oberhauser",
editor = "J. H. Fasel and R. M. Keller",
title = "On the Correspondence of Lambda Style Reduction and Combinator
Style Reduction",
booktitle = "Graph Reduction - Proceedings of a Workshop",
year = "1986",
month = "September/October",
publisher = "Springer-Verlag",
series = "LNCS",
volume = "279",
address = "New Mexico",
}
@INPROCEEDINGS{michelsen:parallel,
author = "R. Michelsen et al",
editor = "J. H. Fasel and R. M. Keller",
title = "Parallel Graph Reduction on a Supercomputer: A Status Report",
booktitle = "Graph Reduction - Proceedings of a Workshop",
year = "1986",
month = "September/October",
publisher = "Springer-Verlag",
series = "LNCS",
volume = "279",
address = "New Mexico",
pages = "114-117",
}
@INPROCEEDINGS{ castan:toward,
author = "M. Castan et al",
editor = "J. H. Fasel and R. M. Keller",
title = "Toward the design of parallel reduction machine - The {MaRS}
project",
booktitle = "Graph Reduction - Proceedings of a Workshop",
year = "1986",
month = "September/October",
publisher = "Springer-Verlag",
series = "LNCS",
volume = "279",
address = "New Mexico",
pages = "160-180",
}
@article{bloss:optimising,
author = "A. Bloss and P. Hudak and J. Young",
title = "An Optimising Compiler for a Modern Functional Language",
journal = "The Computer Journal",
year = "1988",
volume = "31",
pages = "152-161",
number = "6",
}
@article{richards:overview,
author = "H. Richards",
title = "An Overvie of {ARC SASL}",
journal = "SIGPLAN Notices",
year = "1984",
month ="October",
volume = "19",
number = "10",
pages = "40-45",
}
@article{turner:new,
author = "D. A. Turner",
title = "A New Implementation Technique for Applicative Languages",
journal = "Software-Practice and Experience",
year = "1979",
volume = "9",
pages = "31-49",
note ="\newline A seminal paper on the use of graph reduction for evaluation of
combinatory logic expression. Gives a good introduction to CL",
}
@article{hudak:para,
author = "P. Hudak",
title = "Para-Functional Programming ",
journal = "Computer",
year = "1986",
volume = "19",
number = "8",
pages = "60-70",
}
@article{koopman:fresh,
title = "A Fresh Look at Combinator Graph Reduction",
author = "P. J. {Koopman, Jr.} and P. Lee",
journal = " Sigplan Notices",
booktitle = "Proceedings of the Sigplan Conference on Programming
Language Design and Implementation",
year = "1989",
month = "June",
volume = "24",
number = "7",
pages = "110-119",
}
@article{peyton:parallel,
author = "S. L. Peyton-Jones",
title = "Parallel Implementation of Functional Programming Langauges",
journal = "The Computer Journal",
year = "1989",
volume = "32",
pages = "175-186",
number = "2",
}
@article{staples:optimal,
author = "J. Staples",
title = "Optimal evaluations of graph-like expressions",
journal = "Theoretical Computer Science",
year = "1980",
volume = "10",
pages = "297-316",
}
@article{staples:speed,
author = "J. Staples",
title = " Speeding up subtree replacement systems",
journal = "Theoretical Computer Science",
year = "1980",
volume = "11",
pages = "38-47",
}
@article{staples:computation,
author = "J. Staples",
title = "Computation on Graph like Expression",
journal = "Theoretical Computer Science",
year = "1980",
volume = "10",
pages = "171-185",
}
∂12-Feb-90 1000 stager@Sunburn.Stanford.EDU Final Exam Scheduling
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 10:00:28 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16866; Mon, 12 Feb 90 10:00:44 -0800
Date: Mon, 12 Feb 1990 10:00:44 GMT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: stager@Sunburn.Stanford.EDU
Subject: Final Exam Scheduling
Message-Id: <CMM.0.88.634845644.stager@Sunburn.Stanford.EDU>
It's time again to start planning for final exams. (Refer to page 6
of the Winter Quarter Time Schedule if you have questions about Dead Week
policy, or what the examination schedule is.)
Please respond to the following by FRIDAY, FEBRUARY 16.
1. Have you moved to a new room/time (and not let me know)? If so, where
and when are you meeting now?
2. Are you giving a take-home exam instead of an in-class exam?
Do you plan on giving a final exam this quarter?
3. Will you need additional space in order to provide alternate seating?
If so, how many TOTAL seats will you be requiring?
4. Are you giving an alternate exam in addition to your regularly scheduled
exam? If so what day/time, and what size of a room will you be needing?
Please Note:
"Classes starting at unusual times (e.g. 2:30pm or 2:45pm)hold exams in the
same time slots as classes starting at the regular time with the same hour
designation. So, the final examination in the examples above would be given
under the 2:15 time slot."
Contact me at Stager@Score, or 3-6094, if you have any questions.
Thanks.
Claire
∂12-Feb-90 1001 bergman@Sunburn.Stanford.EDU ["Ken Down" <HF.KSD@Forsythe.Stanford.EDU> : indirect cost rates ]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 10:01:07 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16880; Mon, 12 Feb 90 10:01:18 -0800
Date: Mon, 12 Feb 1990 10:01:17 GMT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: ["Ken Down" <HF.KSD@Forsythe.Stanford.EDU> : indirect cost rates ]
Message-Id: <CMM.0.88.634845677.bergman@Sunburn.Stanford.EDU>
FYI, I just received the following message from Ken Down. He is
informing us that the on-campus indirect cost rate for sponsored
research will be held at 78% for FY'91 and following.
-Sharon Bergman
---------------
Return-Path: <HF.KSD@Forsythe.Stanford.EDU>
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15053; Mon, 12 Feb 90 09:10:02 -0800
Message-Id: <9002121710.AA15053@Sunburn.Stanford.EDU>
Date: Mon, 12 Feb 90 09:08:05 PST
To: bergman@CS.Stanford.EDU
From: "Ken Down" <HF.KSD@Forsythe.Stanford.EDU>
Subject: indirect cost rates
11:37:05 02/09/90 FROM HK.PLD "Patricia L. Devaney": indirect cost rates on sponsored projects
Dear Friends: As you know, the Provost announced at yesturday's
Senate meeting several important decisions including restraints
on tuition and indirect cost rate growth, slowdown in our
building program, reductions in the Operating Budget, and plans
for simplifying various administrative processes. Included in his
report was an announcement that the indirect cost rate for on-campus
research projects would be held at 78% MTDC for all expenditures
that take place after 8/31/90 until further notice, while Stanford
continues to maintain its policy of full recovery of indirects through
cost reductions. Further, there is an announced goal of
trying to reduce the rate below 78% in future years.
Therefore, the budgets of all sponsored project proposals should
now use the announced FY91 indirect cost rates for expenditures
proposed to take place after 8/31/90, including costs
that are projected to go into FY92 and subsequent years.
The only exception to this instruction is for off-campus sponsored
research projects for which the indirect cost rate had been
projected to drop from this year's rate of 54% to 52% in FY91 and
to 51% in FY92. For proposed off-campus research expenditures,
continue to use the previously-announced rates.
Therefore, the indirect cost rates to use until further notice are:
FY90 FY91 FY92+
on-campus sponsored research 74% 78% 78%
off-campus sponsored research 54% 52% 51%
on-campus sponsored instruction 63% 61% 61%
off-campus sponsored instruction 56% 53% 53%
"other" sponsored activities 25% 35% 35%
Please relay this information to your department chairs and
administrators. A general mailing about this and related news
will be sent to all PI's, but it may not reach them for a couple
of weeks. Thanks, Pat
To: BYER@SIERRA, KEEP(MU.SIK), Down(HF.KSD), Fyfe(MA.JHF), HK.DHM,
Gaddy(HK.ARG), AS.CFB, Kuhlman(AS.NON), AS.JDS, BL.FRG
To: RESADM(AS.KCC,AS.KWM,HF.GDR,HF.KXM,HF.RAD,HF.RRK,NA.BJS,NA.PLP,NA.SEW,
NA.XFG), DEPTCONT(CARILLI@SIERRA,DIETRICH@SIERRA,DISKIN@KRAKATOA,
GERLACH@SIERRA,HF.GLS,HF.JJC,HF.RRK,HF.SMS,JC.PAB,NC.MXJ,NJ.DMS,NK.NMF,
PETERSON@SIERRA,WHEATON@POLYA), BERGMAN@POLYA
∂12-Feb-90 1004 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU More on Monkeys
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 10:04:40 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA14561; Mon, 12 Feb 90 10:05:08 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16966; Mon, 12 Feb 90 10:02:27 -0800
Message-Id: <9002121802.AA16966@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8987; Mon, 12 Feb 90 11:53:23 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8976; Mon, 12 Feb 90 11:53:20 CST
Date: Mon, 12 Feb 90 11:51:43 CST
Reply-To: David Harel <harel%wisdom.weizmann.ac.il@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: David Harel <harel%wisdom.weizmann.ac.il@VM1.NoDak.EDU>
Subject: More on Monkeys
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I would like to clear up the issue of the NP-completeness of the monkey-puzzle
problem. The problem appeared on pages 153-155 of "Algorithmics: The Spirit of
Computing", Addison-Wesley, 1987, where it used as an example of an NP-complete
problem. It is a generalized version of the well-known problem involving 9 cards
with tops and bottoms of colored monkeys (or elephants, or whatever), which have
to be arranged in a square of size 3x3, such that colors and monkey-halves
match. A less zoological version is this:
INPUT: a set of n↑2 square tiles, each colored at the edges, and each with a
fixed orientation (although this last restriction is not important). Colors
are paired, and tiling must adhere to the pairing, in the sense that adjacent
edges must be colored with matching colors.
OUTPUT: "yes" iff these very n↑2 tiles can be arranged in a legal nxn square.
There followed a spree of email, started with a query by Anne Lomax on TheoryNet
The main issue was whether or not this was simply the standard tiling problem,
well known to be NP-complete (Levin 1973, Garey, Johnson and Papadimitriou 1977,
Lewis 1978). It clearly isn't that problem exactly, since here you have to use
exactly the n↑2 given tiles, whereas in the standard problem you are given a set
of tile TYPES and a number n, and the tiling of the nxn square is to be done
using tiles from among the given set. The proof I had in mind when using the
problem in the book is the following, inspired by a discussion with Adi Shamir:
PROOF#1: The reduction is from 3-PARTITION (Garey and Johnson, p. 224), which is
NP-complete in the strong sense. Given the 3m numbers and the bound B that form
an input to 3-PARTITION, prepare a set of cards for each number, that make it
possible to tile the tiles in this set side by side only. Hence,if the number is
say, 17, there will be 17 cards that can only fit together to form a line of
length 17. Each of these tile lines has colors to enable it to be attached on
either end to any other such line. In addition, each line is colored on the top
and bottom to enable attachment to other such lines from above and below. It now
helps to assume that m>B (the proof can be easily modified to cover the more
general case). Now, prepare a set of m(m-B) tiles of a special kind, that enable
ONLY a tiling of a rectangle of width m-B and height m, whose left hand side can
be attached to the ends of the lines coming from the numbers. It can now be
shown that these tiles can tile an mxm square if and only if the 3m numbers can
be partitionied into m triplets, each summing to B.
In an email exchange with Leonid Levin, he showed that, in fact, the difference
between this version of tiling and the usual does not cause much of a problem,
and one can use the latter for the reduction. Here is his proof:
PROOF#2: Since the regular tiling problem is is NP-complete even with a fixed,
constant number of tiles, the reduction can be carried out as follows.
Given k tiles and n (in unary), and having to say whether they can be used to
tile an nxn square, proceed by submitting to the monkey-puzzle problem all
possibilities of preparing sets of n↑2 tiles from among the given k tile types.
Since each of these k tile types can appear at most n↑2 times, there is a bound
of n↑(2xk) on the number of monkey-puzzle problems you must try. Hence the
reduction is polynomial.
∂12-Feb-90 1006 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Monkeys are NP-complete
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 10:05:55 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA14596; Mon, 12 Feb 90 10:05:53 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17128; Mon, 12 Feb 90 10:05:38 -0800
Message-Id: <9002121805.AA17128@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9019; Mon, 12 Feb 90 11:54:57 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9010; Mon, 12 Feb 90 11:53:55 CST
Date: Mon, 12 Feb 90 11:52:23 CST
Reply-To: Piotr Berman <berman%cs.psu.psu.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Piotr Berman <berman%cs.psu.psu.edu@VM1.NoDak.EDU>
Subject: Re: Monkeys are NP-complete
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
One should also notice that there are only two monkeys on each card.
I tried to reconstruct the reduction from Hamiltonian Path and
given a graph with n veritices and e edges, I used roughly e↑2 cards,
such large description of the reduction result suggests that this
problem is not complete on average.
Piotr
∂12-Feb-90 1019 chandler@Sunburn.Stanford.EDU ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : Annual
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 10:18:58 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16865; Mon, 12 Feb 90 10:00:40 -0800
Date: Mon, 12 Feb 1990 10:00:39 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: csdlist@cs.Stanford.EDU
Subject: ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : Annual
Forsythe Lectures ]
Message-Id: <CMM.0.88.634845639.chandler@Sunburn.Stanford.EDU>
Return-Path: <chandler>
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13200; Mon, 12 Feb 90 08:24:14 -0800
Full-Name: Joyce R. Chandler
Date: Mon, 12 Feb 1990 8:24:13 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: Annual Forsythe Lectures
Message-Id: <CMM.0.88.634839853.chandler@Sunburn.Stanford.EDU>
Professor Richard P. Brent will deliver the George and Sandra Memorial
Lectures in Computer Science today and tomorrow. Professor Brent is well
known for his work on parallel numerical algorithms, computational number
theory, and analysis of algorithms. He was a student of Professors Gene
Golub and George Forsythe at Stanford, where he obtained a Ph.D. in Computer
Science in 1971.
His first lecture, entitled "Parallel Computation", will be given in
Fairchild Auditorium at 7:30 p.m. (this evening). The lecture will be of
general interest to people in the computer community. There will be a
reception in the Fairchild Auditorium foyer immediately following the
lecture.
Abstract: Parallel Computation
The era of serial computation, typified by Von Neumann computers and Turing
machines, is coming to an end. Parallel computation is now central to
computer Science, and its importance will increase in the future.
This lecture will discuss the motivation for parallel computation (physical
constraints on serial computation, biological examples of parallel
computation). We shall outline some practical parallel computer
architectures - tightly coupled synchronous machines, loosely coupled
asynchronous networks, shared memory and local memory machines, hypercubes
and systolic arrays. Concepts such as the speedup and efficiency of parallel
algorithms will be discussed and illustrated by some examples. Finally,
theoretical models of parallel computation and the relationship between
serial space and parallel time wil be considered.
The second lectures, entitled "Fast Training Algorithms for Multilayer Neural
Nets", will be given at 4:15 p.m. tomorrow afternoon in Jordan 040
(Psychology Building).
Abstract: Fast Training Algorithms for Multilayer Neural Nets
Training a multilayer neural net by back-propagation is slow and requires
arbitrary choices regarding the number of hidden units and layers. We shall
describe an algorithm which is much faster than back-propagation and for
which it is not necessary to specify the number of hidden units in advance.
The relationship with other fast pattern recognition algorithms, such as
algorithms based on k-d trees, will be discussed.
The algorithm has been implemented and tested on artificial problems such as
the parity problem and on real problems arising in speech recognition.
Experimental results, including training times and recognition accuracy. will
be presented. Generally our algorithm achieves accuracy as good as or better
than neural nets trained using back-propagation, and the training process is
much faster than back-propagation. Recognition accuracy is comparable to
that for the "nearest neighbour" algorithm, which is usually slower and
requires more storage space. We conclude that our algorithm is useful for
practical pattery recognition, although whether it says anything new about
neural nets is debatable.
∂12-Feb-90 1040 gerlach@sierra.STANFORD.EDU indirect cost rates
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 10:40:50 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Mon, 12 Feb 90 10:35:31 PST
Date: Mon, 12 Feb 90 10:35:31 PST
From: gerlach@sierra.STANFORD.EDU (Sharon Gerlach)
To: ee-faculty@sierra.STANFORD.EDU
Cc: gerlach@sierra.STANFORD.EDU, ee-adminlist@sierra.STANFORD.EDU
Subject: indirect cost rates
Message-Id: <CMM.0.88.634847728.gerlach@>
11:37:05 02/09/90 FROM HK.PLD "Patricia L. Devaney": indirect cost rates on
sponsored projects
Dear Friends: As you know, the Provost announced at yesturday's
Senate meeting several important decisions including restraints
on tuition and indirect cost rate growth, slowdown in our
building program, reductions in the Operating Budget, and plans
for simplifying various administrative processes. Included in his
report was an announcement that the indirect cost rate for on-campus
research projects would be held at 78% MTDC for all expenditures
that take place after 8/31/90 until further notice, while Stanford
continues to maintain its policy of full recovery of indirects through
cost reductions. Further, there is an announced goal of
trying to reduce the rate below 78% in future years.
Therefore, the budgets of all sponsored project proposals should
now use the announced FY91 indirect cost rates for expenditures
proposed to take place after 8/31/90, including costs
that are projected to go into FY92 and subsequent years.
The only exception to this instruction is for off-campus sponsored
research projects for which the indirect cost rate had been
projected to drop from this year's rate of 54% to 52% in FY91 and
to 51% in FY92. For proposed off-campus research expenditures,
continue to use the previously-announced rates.
Therefore, the indirect cost rates to use until further notice are:
FY90 FY91 FY92+
on-campus sponsored research 74% 78% 78%
off-campus sponsored research 54% 52% 51%
on-campus sponsored instruction 63% 61% 61%
off-campus sponsored instruction 56% 53% 53%
"other" sponsored activities 25% 35% 35%
Please relay this information to your department chairs and
administrators. A general mailing about this and related news
will be sent to all PI's, but it may not reach them for a couple
of weeks. Thanks, Pat
∂12-Feb-90 1104 chandler@Sunburn.Stanford.EDU Annual Forsythe Lectures
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 11:03:53 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13200; Mon, 12 Feb 90 08:24:14 -0800
Date: Mon, 12 Feb 1990 8:24:13 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: Annual Forsythe Lectures
Message-Id: <CMM.0.88.634839853.chandler@Sunburn.Stanford.EDU>
Professor Richard P. Brent will deliver the George and Sandra Memorial
Lectures in Computer Science today and tomorrow. Professor Brent is well
known for his work on parallel numerical algorithms, computational number
theory, and analysis of algorithms. He was a student of Professors Gene
Golub and George Forsythe at Stanford, where he obtained a Ph.D. in Computer
Science in 1971.
His first lecture, entitled "Parallel Computation", will be given in
Fairchild Auditorium at 7:30 p.m. (this evening). The lecture will be of
general interest to people in the computer community. There will be a
reception in the Fairchild Auditorium foyer immediately following the
lecture.
Abstract: Parallel Computation
The era of serial computation, typified by Von Neumann computers and Turing
machines, is coming to an end. Parallel computation is now central to
computer Science, and its importance will increase in the future.
This lecture will discuss the motivation for parallel computation (physical
constraints on serial computation, biological examples of parallel
computation). We shall outline some practical parallel computer
architectures - tightly coupled synchronous machines, loosely coupled
asynchronous networks, shared memory and local memory machines, hypercubes
and systolic arrays. Concepts such as the speedup and efficiency of parallel
algorithms will be discussed and illustrated by some examples. Finally,
theoretical models of parallel computation and the relationship between
serial space and parallel time wil be considered.
The second lectures, entitled "Fast Training Algorithms for Multilayer Neural
Nets", will be given at 4:15 p.m. tomorrow afternoon in Jordan 040
(Psychology Building).
Abstract: Fast Training Algorithms for Multilayer Neural Nets
Training a multilayer neural net by back-propagation is slow and requires
arbitrary choices regarding the number of hidden units and layers. We shall
describe an algorithm which is much faster than back-propagation and for
which it is not necessary to specify the number of hidden units in advance.
The relationship with other fast pattern recognition algorithms, such as
algorithms based on k-d trees, will be discussed.
The algorithm has been implemented and tested on artificial problems such as
the parity problem and on real problems arising in speech recognition.
Experimental results, including training times and recognition accuracy. will
be presented. Generally our algorithm achieves accuracy as good as or better
than neural nets trained using back-propagation, and the training process is
much faster than back-propagation. Recognition accuracy is comparable to
that for the "nearest neighbour" algorithm, which is usually slower and
requires more storage space. We conclude that our algorithm is useful for
practical pattery recognition, although whether it says anything new about
neural nets is debatable.
∂12-Feb-90 1126 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU New BITNET address for IBM Almaden
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 11:26:24 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA20297; Mon, 12 Feb 90 11:24:27 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18972; Mon, 12 Feb 90 11:23:10 -0800
Message-Id: <9002121923.AA18972@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4219; Mon, 12 Feb 90 13:20:40 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4203; Mon, 12 Feb 90 13:20:37 CST
Date: Mon, 12 Feb 90 13:19:12 CST
Reply-To: Ron Fagin <FAGIN%ALMADEN.BITNET@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ron Fagin <FAGIN%ALMADEN.BITNET@VM1.NoDak.EDU>
Subject: New BITNET address for IBM Almaden
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
----------------------------------------------------------------------
***New BITNET address for IBM Almaden***
The machine ALMVMA has gone away from IBM Almaden, and the new
BITNET address is ALMADEN, rather than ALMVMA.
However, you should also be warned that some locations have not
updated their routing tables, and do not know the name ALMADEN.
You should use the following algorithm:
1. Start sending your BITNET messages to ALMADEN rather than ALMVMA
(similarly, replace ALMVMB and ALMVMC by ALMADEN).
2. If the message bounces at your location, do the following:
a. send the message instead to ALMVMA (for a while, mail sent to
ALMVMA will be forwarded to ALMADEN), and
b. tell your local BITNET postmaster to update your routing tables.
The CSNET address for IBM Almaden remains unchanged (namely, ibm.com).
--Ron Fagin
∂12-Feb-90 1228 betsy@russell.Stanford.EDU ["Michele Armstrong" <RS.MMA@Forsythe.Stanford.EDU>: New Indirect Cost Rates]
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 12:28:31 PST
Received: by russell.Stanford.EDU (4.0/inc-1.0)
id AA08327; Mon, 12 Feb 90 12:31:06 PST
Date: Mon 12 Feb 90 12:31:05-PST
From: Betsy Macken <BETSY@CSLI.Stanford.EDU>
Subject: ["Michele Armstrong" <RS.MMA@Forsythe.Stanford.EDU>: New Indirect Cost Rates]
To: faculty@russell.Stanford.EDU
Message-Id: <634854665.0.BETSY@CSLI.Stanford.EDU>
In-Reply-To: <9002121928.AA07449@/user/betsy/out.txt
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
fyi
---------------
Return-Path: <RS.MMA@Forsythe.Stanford.EDU>
Received: from csli.Stanford.EDU by russell.Stanford.EDU (4.0/inc-1.0)
id AA07840; Mon, 12 Feb 90 11:44:39 PST
Received: from Forsythe.Stanford.EDU by csli.Stanford.EDU (4.1/inc-1.0)
id AA26836; Mon, 12 Feb 90 11:43:18 PST
Message-Id: <9002121943.AA26836@csli.Stanford.EDU>
Date: Mon, 12 Feb 90 11:41:04 PST
To: betsy@csli.stanford.edu
>From: "Michele Armstrong" <RS.MMA@Forsythe.Stanford.EDU>
Subject: New Indirect Cost Rates
To: Directors of the Independent Laboratories/Centers/Institutes
>From: Michele Armstrong
I have received the following memo from Pat Devaney regarding the
indirect cost rate for University Fiscal Years 1990-91 and beyond.
I would appreciate it if you would circulate it to all faculty
members in your area. A copy will be sent to your administrators
as well. A formal notice from Bob Byer to all faculty will be
distributed soon.
If you have questions, please call me on 3-1655 or send e-mail to
RS.MMA@forsythe. Thank you very much.
---------------------------------
11:34:49 02/09/90 FROM HK.PLD "Patricia L. Devaney":
Dear Friends: As you know, the Provost announced at yesturday's
Senate meeting several important decisions including restraints
on tuition and indirect cost rate growth, slowdown in our
building program, reductions in the Operating Budget, and plans
for simplifying various administrative processes. Included in his
report was an announcement that the indirect cost rate for on-campus
research projects would be held at 78% MTDC for all expenditures
that take place after 8/31/90 until further notice, while Stanford
continues to maintain its policy of full recovery of indirects through
cost reductions. Further, there is an announced goal of
trying to reduce the rate below 78% in future years.
Therefore, the budgets of all sponsored project proposals should
now use the announced FY91 indirect cost rates for expenditures
proposed to take place after 8/31/90, including costs
that are projected to go into FY92 and subsequent years.
The only exception to this instruction is for off-campus sponsored
research projects for which the indirect cost rate had been
projected to drop from this year's rate of 54% to 52% in FY91 and
to 51% in FY92. For proposed off-campus research expenditures,
continue to use the previously-announced rates.
Therefore, the indirect cost rates to use until further notice are:
FY90 FY91 FY92+
on-campus sponsored research 74% 78% 78%
off-campus sponsored research 54% 52% 51%
on-campus sponsored instruction 63% 61% 61%
off-campus sponsored instruction 56% 53% 53%
"other" sponsored activities 25% 35% 35%
Please relay this information to your department chairs and
administrators. A general mailing about this and related news
will be sent to all PI's, but it may not reach them for a couple
of weeks. Thanks, Pat
To: A@SSRL750, HAGSTROM@SIERRA, E7.F61, PANTELL@SIERRA, PETERS@CSLI,
PAT%IMSSS@SCORE, HF.LAB
cc: GOULD@SSRL750, BOWMAN@SSRL750, RK.ETW, HOGAN@SIERRA, HF.MGE, HF.VAO,
JOYCE@CSLI, BETSY@CSLI, RC.NEO
-------
-------
∂12-Feb-90 1719 snoeyink@Neon.Stanford.EDU BATS abstracts for friday
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Feb 90 17:19:43 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA16157; Mon, 12 Feb 90 17:19:05 -0800
Date: Mon, 12 Feb 90 17:19:05 -0800
From: Jack Snoeyink <snoeyink@Neon.Stanford.EDU>
Message-Id: <9002130119.AA16157@Neon.Stanford.EDU>
To: aflb-su@Neon.Stanford.EDU, esc@sumex-aim.Stanford.EDU,
sawyer@Neon.Stanford.EDU, gao@Neon.Stanford.EDU,
feldman@Neon.Stanford.EDU, ilan@Neon.Stanford.EDU,
agupta@Neon.Stanford.EDU
Subject: BATS abstracts for friday
Please tell me pronto if you will be there for lunch.
Also, if you need/can give a ride. I'll try to coordinate carpooling.
o Jack
_/\_.
(')>-(`) snoeyink@cs.stanford.edu
BATS will be on Friday February 16, at the International Computer
Science Institute in Berkeley. The following are instructions
on how to get there and the schedule of talks.
*************************************************************************
The schedule is as follows:
10:10 Madhu Sudan (Berkeley): On-line Algorithms for Locating
Checkpoints
11:10 Jehoshua Bruck (IBM Almaden): Harmonic Analyisis of Neural Networks
12:00 LUNCH
1:10 Noga Alon (IBM Almaden and Tel Aviv University):
Separating Graohs with an Excluded Minor
2:10 Raimund Seidel (Berkeley): Randomized Geometric Algorithms
Viewed SDRAWKCAB
---------------------------------------------------------------------
SEPARATING GRAPHS WITH AN EXCLUDED MINOR
Noga Alon
IBM Almaden and Tel Aviv University
Let G be an n-vertex graph with nonnegative weights whose sum is 1
assigned to its vertices, and with no minor isomorphic to a given
h-vertex graph H. We prove that there is a set X of no more than
h↑{3/2}n↑{1/2} vertices of G whose deletion creates a graph in which the
total weight of every connected component is at most 1/2. This extends
significantly a theorem of Lipton and Tarjan for planar graphs. We
exhibit an algorithm which finds, given an n-vertex graph G with m edges
and with weights as above and an h-vertex graph H, either such
a set X or a minor of G isomorphic to H. The algorithm runs
in time O( h↑{1/2} n↑{1/2} m ). Besides several combinatorial
applications, these results supply extensions
of the many known applications of the Lipton-Tarjan separator
theorem from the class of planar graphs (or that of graphs with
bounded genus) to any class of graphs with an excluded minor.
For example, it follows that for any fixed graph H , given a graph
G with n vertices and with no H-minor one can approximate the size
of the maximum independent set of G up to a relative error of
1/logn in polynomial time, find that size exactly
and find the chromatic number of G in time 2↑{O( sqrt{n})}
and solve any sparse system of n linear equations in n unknowns
whose sparsity structure corresponds to G in time O(n↑{3/2}).
This is a joint work with Paul Seymour and Robin Thomas.
=======================================================================
ON-LINE ALGORITHMS FOR LOCATING CHECKPOINTS
Madhu Sudan
University of California, Berkeley
Motivated by applications in data compression, debugging,
and physical simulation,
we consider the problem of adaptively choosing locations
in a long computation at which to save intermediate results.
Such checkpoints allow faster recomputation of
arbitrary requested points within the computation.
We abstract the problem to a server problem in which $k$
servers move along a line in a single direction,
modeling the fact that most computations are not reversible.
Since checkpoints may be arbitrarily copied,
we allow a server to jump to any location currently occupied by
another server.
We present online algorithms and analyze their competitiveness.
We give lower bounds on the competitiveness of
any online algorithm and show that our algorithms
achieve these bounds within relatively small factors.
This is a result of joint work with Marshall Bern, Dan Greene and
Arvind Raghunathan
===================================================================
HARMONIC ANALYSIS OF NEURAL NETWORKS
Jehoshua Bruck
IBM Almaden Research Center
Artificial neural networks are networks in which
every node computes a linear threshold Boolean function.
There exists a large gap between
the empirical evidence of the computational power of neural
networks and our ability to analyze and design those networks.
I will present a novel approach, based on harmonic analysis
of Boolean functions, to analyze networks of threshold elements.
I will show that the class of polynomial threshold functions
(functions that can be computed as a sign function of a sparse
polynomial) can be characterized using their spectral norms,
in particular, the $L_1$ and the $L_\infty$ norms.
I will mention a few of the applications of this characterization:
(i) Proving that the class of polynomial threshold functions is
strictly contained in the class of functions that can be computed
by a depth-2 polynomial size circuit of linear threshold elements.
(ii) Lower bounds for the complexity of computing $AC↑0$ functions
using threshold elements.
(iii) Proving that an arbitrary linear threshold function can be computed
by a depth-3 circuit of MAJORITY gates.
(iv) Proving that the multiplication of two $n$-bit numbers can be
computed by a depth-4 circuit of MAJORITY gates.
Parts of this work are in collaboration with Sunny Siu and with Roman
Smolensky.
=====================================================================
RANDOMIZED GEOMETRIC ALGORITHMS
VIEWED
SDRAWKCAB
Raimund Seidel
University of California, Berkeley
A number of randomized geometric algorithms and data structures
admit a surprisingly simple analysis of their expected performance
if one adopts a certain "backward" view. I will illustrate this
approach on a number of problems such as convex hulls, linear
programming, triangulations, sorting, searching, and planar
point location.
*************************************************************************
DRIVING INSTRUCTIONS TO BATS:
ICSI is located on the 6th floor of 1947 Center Street. It is a
light brown building on the north side of the Street across from
a little park.
To get to ICSI from Highway 80, take the University Avenue
exit, and continue until Martin Luther King Ave. Take a right on MLK,
and then take a left on Center (the second street, I think).
To get to the university from Highway 13, Highway 13 from the south
turns naturally into Ashby heading west. Take Ashby until Shattuck.
Take a right on Shattuck. Continue until Center Street (where Shattuck splits),
and take a left on Center. ICSI is in the second block down,
on the right.
To take BART, get off at the Berkeley BART station. The round building which
is one of the entrances to the BART station is on the corner
of Center and Shattuck. Go West on Center. ICSI is in the second block down,
on the right.
PARKING:
There are two parking garages on Center Street, in the block East
of ICSI (that's towards Shattuck, away from MLK). The parking on the
street is only 1 or 2 hour parking, so the garages are probably best.
*************************************************************************
∂13-Feb-90 0715 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU WOBCATS meeting on February 26, 1990
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Feb 90 07:14:59 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21526; Tue, 13 Feb 90 07:15:31 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05533; Tue, 13 Feb 90 07:15:12 -0800
Message-Id: <9002131515.AA05533@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3411; Tue, 13 Feb 90 08:27:25 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3396; Tue, 13 Feb 90 08:27:21 CST
Date: Tue, 13 Feb 90 08:25:45 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
art@cs.sfu.ca
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: art%cs.sfu.ca@VM1.NoDak.EDU
Subject: WOBCATS meeting on February 26, 1990
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The next WOBCATS meeting will be held in room 9896 of the new Applied Sciences
Building at Simon Fraser University in beautiful Burnaby, B. C. on Monday,
February 26, 1990. The speakers will be Chris Wilson (U. of Oregon),
Deborah Joseph (visiting U. of Washington) and Maria Klawe (U. of British
Columbia).
See abstracts below.
Schedule
11:00 coffee, juice, muffins
11:30 talk by Maria Klawe
12:30 lunch
1:30 talk by Chris Wilson
2:30 break
3:15 talk by Deborah Joseph
4:15 adjourn to University Club for socialism
The Applied Sciences Building is located at the southeastern edge of the
campus and is near a visitors parking lot. From the TransCanada Highway
(Hwy 1), take the Cariboo exit and proceed on Gaglardi Way to SFU.
There is an information booth at the main entrance. The folks there can
direct you to visitors parking and to our building.
If you are coming from far away and need accommodation, we recommend the
Best Western Coquitlam Motor Inn ((604)-931-9011) with rates in the $80-
$100 range. (for example, two beds/two persons is $89.00) The Inn is about
ten minutes from SFU by car and also close to an SFU-bound bus. (You can't
get much closer since we are on top of a (small) mountain.) Please mention
the School of Computing Science at SFU when you call for a reservation.
If you wish to stay in downtown Vancouver, there are lots of hotels but you
are on your own.
If you are flying to Vancouver, SFU (and the Coquitlam Best Western) are
about 45 minutes (by car) from the airport if there is no traffic (or snow).
Please let me know how many people from your institution will be attending
(no later than February 19, please) so that we can arrange lunch.
AND NOW, THE ABSTRACTS:
*****************************************************************************
An O(n log log n) Algorithm for Polygon Triangulation with Simple
Data-Structures
by Maria M. Klawe
Partitioning the interior of a polygon into triangles by adding
non-intersecting diagonals of the polygon has widespread applications
in computer graphics, pattern recognition, and computational morphology,
as well as playing a fundamental role as a building block in the
solution of many problems in computational geometry. In this talk,
we present a new O(n log log n) time algorithm for triangulating simple
n-vertex polygons, which avoids the use of complicated data-structures.
The major new technique employed is a linear time algorithm for obtaining
the horizontal visibility partition of a subchain of a polygonal chain,
from the horizontal visibility partition of the entire chain. This
technique has other interesting applications including a linear time
algorithm to convert a Steiner triangulation of a polygon to a true
triangulation. (The work presented is joint work with David Kirkpatrick
and Bob Tarjan.)
*****************************************************************************
Circuits with Limited Negations
by Chris Wilson
There recently have been some very nice results on the limitations of the
power of certain types of monotone circuits. These results would answer
fundamental questions in complexity theory if they could be carried over
to the non-monotone case. A question we address is an intermediate one:
what is the power of circuits with a limitation on the number of negation
gates? How much can this number be limited without changing the power of
the circuit class? A basic theorem of Markov is that the minimum number
of negation gates needed for a circuit to compute any Boolean function on
n variables is log n, but these circuits have no restriction on their size
or depth. We show that this result holds down to NC↑1: log n negations are
necessary and sufficient to compute everything within NC↑1. On the contrary,
constant depth threshold circuits (TC↑0) and constant depth circuits (AC↑0)
behave quite differently. For each of these classes we derive essentially
matching upper and lower bounds on the number of negations which preserve
the class. (This talk describes joint work with Miklos Santha.)
*****************************************************************************
The Complexity of Finding Minimum Nested Polyhedra
by Deborah Joseph
In this talk we consider the following problem. Given two nested polyhedra,
P and Q, with Q nested in P, find a third polyhedron R that encloses
Q and is contained in P such that the number of faces on R is minimal.
This problem was posed by Klee and a polynomial time algorithm was given
by Aggarwal, Booth, O'Rourke, Suri and Yap for the 2-dimensional problem.
We show that the 3-dimensional problem is NP-hard. (This talk describes
joint work with Gautam Das.)
*****************************************************************************
For more information, please contact:
Art Liestman (604)-291-4197 (art@cs.sfu.ca) (FAX (604)-291-3045)
∂13-Feb-90 0845 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU AFLB Thursday
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Feb 90 08:45:01 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23071; Tue, 13 Feb 90 08:44:19 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07073; Tue, 13 Feb 90 08:44:56 -0800
Message-Id: <9002131644.AA07073@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: AFLB Thursday
Date: Tue, 13 Feb 90 08:44:53 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
The speaker at this week's AFLB will be Ronitt Rubenfeld, from Berkeley.
AFLB will meet at 12:00 Thursday in MJH 252.
Self-Testing/Correcting Programs with Applications
to Numerical Problems
A {\em self-testing/correcting pair} for a function $f$ is a pair
of probabilistic programs $(T,C)$ that have the following properties.
Let $P$ be any program that purportedly computes $f$.
$T$ and $C$ both make calls to $P$, and both are required to run much
faster than any correct program for $f$, not counting the time for
calls to $P$. Tester $T$ estimates the probability that $P$
incorrectly computes $f$ with respect to a distribution $D$ on inputs.
If $P$ is not too faulty with respect to $D$, then corrector $C$ on
input $x$ uses $P$ to compute $f(x)$ correctly with high
probability, where this probability is independent of $x$.
$(T,C)$ is an {\em efficient} pair if their total running times,
including time for calls to $P$, is big Oh of the running time of $P$.
We present general techniques for constructing simple to program and
efficient self-testing/correcting pairs for a variety of numerical
problems, including integer multiplication, modular multiplication,
matrix multiplication, inverting matrices, computing the determinant
of a matrix, computing the rank of a matrix, integer division,
modular exponentiation and polynomial multiplication.
One of the central ideas is to design a self-testing/correcting pair
that makes calls to a library of programs for a variety of functions.
For example, the self-testing/correcting pair for computing the rank
of a matrix makes calls to programs for computing matrix multiplication,
inverting matrices and computing determinants of matrices, but does not
assume that any particular answer it receives from these programs is correct.
Joint work with Manuel Blum and Michael Luby.
∂13-Feb-90 0950 eisensee@sierra.STANFORD.EDU Solid State Lab Seminar
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 13 Feb 90 09:50:16 PST
Received: by sierra.STANFORD.EDU (3.2/4.7); Tue, 13 Feb 90 09:39:41 PST
Date: Tue, 13 Feb 90 09:39:41 PST
From: eisensee@sierra.STANFORD.EDU (Sandra K. Eisensee)
To: ee-adminlist@sierra, ee-faculty@sierra, Iclabusers@glacier
Cc: cis-people@glacier
Subject: Solid State Lab Seminar
Message-Id: <CMM.0.88.634930777.eisensee@>
SOLID STATE LAB SEMINAR
AKA EE 430
TIME: 4:00pm REFRESHMENTS
4:15pm TALK STARTS
PLACE: AEL 109
DATE: FEBRUARY 14, 1990
LAWRENCE S. PAN, PIERO PIANETTA
STANFORD SYNCHROTRON RADIATION UNIVERSITY
DON R. KANIA
LAWRENCE LIVERMORE NATIONAL LABORATORY
"TRANSIENT PHOTOCONDUCTIVITY IN DIAMOND"
Transient photoconductivity has been used to study carrier lifetimes and
mobilities in diamond. We have performed these measurements on both natural
(single-crystal) diamonds and on polycrystalline diamond films. For
instrinsic excitations, light of energy greater than the bandgap (5.5 eV) is
needed. For this, we have used a short pulse laser, whose output is mixed to
produce UV light, and a synchrotron storage ring, whose output includes
photons from the UV up to x-rays of energy 5 keV. A description of the sample
preparation, which is non-trivial in the case of the films, and analysis of
the measured signals are given. Among the results are mobility values of 500
to 3000 cm2/V-s in the natural diamonds, and 0.1 to 1 cm2/V-s in the films.
Lifetimes are in the range of 100 ps to 5 ns in the natural samples. In the
films, two distinct components of decay are observed. A fast decay similar to
those seen in the natural diamonds is seen first, followed by a slow tail.
Also, interesting density-dependent effects on the mobilities and lifetimes in
natural diamonds are observed. A model is presented that matches the data
over 5 orders of magnitude in density. Finally it should be noted that, in
making these measurements, we have constructed useful UV and x-ray
photodetectors, which are among the first electronic applications of the
diamond films.
∂13-Feb-90 1349 hall@cis.Stanford.EDU SPECIAL SEMINAR
Received: from sierra.STANFORD.EDU by SAIL.Stanford.EDU with TCP; 13 Feb 90 13:49:19 PST
Received: from cis.Stanford.EDU by sierra.STANFORD.EDU (3.2/4.7); Tue, 13 Feb 90 13:45:32 PST
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA01022; Tue, 13 Feb 90 13:45:38 PST
Message-Id: <9002132145.AA01022@cis.Stanford.EDU>
To: cis-people@glacier.Stanford.EDU, ee-faculty@sierra.Stanford.EDU
Subject: SPECIAL SEMINAR
Date: Tue, 13 Feb 90 13:45:34 PST
From: hall@cis.Stanford.EDU
****************
* Seminar *
******************** ANNOUNCEMENT ******************
Stanford University and Hitachi, Ltd
will be hosting a
SEMINAR AND PANEL DISCUSSION
on the afternoon of
TUESDAY, February 20, 1990
in Durand 450
PROGRAM AGENDA will begin at 1:15 and include talks on:
- A Fully Depleted Lean Channel Transistor (Delta)--A Novel Vertical
Ultra Thin SOI MOSFET
- A 23 ns 4Mb CMOS SRAM with 0.5uA Standby Current
- A 80 ns 1Mb Flash EEPROM wisth On-chip Erase/EraseVerify Controller
There will be a BREAK and refreshments from 3:15 - 3:45.
The PANEL DISCUSSION will be from 3:45 - 5:00. The topic is:
Ultimate Devices and Ultimate Circuits for ULSI Integrated Circuits
***********************************************************
∂13-Feb-90 1428 littell@Sunburn.Stanford.EDU Fellowship supplement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Feb 90 14:28:53 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19527; Tue, 13 Feb 90 14:30:09 -0800
Date: Tue, 13 Feb 90 14:30:09 -0800
From: Angelina M. Littell <littell@Sunburn.Stanford.EDU>
Message-Id: <9002132230.AA19527@Sunburn.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU, clt@cs.Stanford.EDU
Cc: littell@Sunburn.Stanford.EDU
Subject: Fellowship supplement
John,
I am working on fellowship supplements for Winter quarter. I have Ramin Zabih
as working for you for winter quarter. Will you be supporting his supplement
for this quarter? If so, what account should I charge it to? His supplement
amount is $287.33. Please inform.
THanks.
--Angie
∂14-Feb-90 1430 ingrid@russell.Stanford.EDU CSLI Calendar, 15 February, vol. 5:17
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Feb 90 14:30:04 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA13746; Wed, 14 Feb 90 13:54:11 PST
Date: Wed, 14 Feb 90 13:54:11 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9002142154.AA13746@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 15 February, vol. 5:17
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
15 February 1990 Stanford Vol. 5, No. 17
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 15 FEBRUARY 1990
12:00 noon TINLunch
Cordura 100 Reflexives and Subject Antecedents
Annie Zaenen
(zaenen.pa@xerox.com)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Characteristics of Different Neurogenic
Communication Disorders
Terry Wertz
Chief, Audiology and Speech Pathology
VA Medical Center
Abstract in last week's Calendar
3:30 p.m. TEA
Cordura 117
(2d lounge)
4:15 p.m. CSLI Colloquium
Ventura 17 Some Restructuring Effects in German
Jaklin Kornfilt
University of Syracuse
Abstract below
____________
ANNOUNCEMENT
There will be no TINLunch, CSLI Seminar, or CSLI Colloquium next
Thursday, 22 February. TINLunch will resume on Thursday, 1 March, and
will be announced in next week's Calendar.
____________
THIS WEEK'S CSLI COLLOQUIUM
Some Restructuring Effects in German
Jaklin Kornfilt
Some recent work (e.g., Kayne, den Besten) has suggested that
restructuring (or its equivalents, like multidimensional
representations) can be avoided by using mechanisms such as
head-to-head movement, scrambling, etc. This paper looks at three
construction types in German, all of which involve apparent locality
violations, and argues that these constructions cannot be accounted
for by the proposed alternatives to restructuring, in turn triggered
by verb raising. A treatment of restructuring in terms of
morphologically derived and syntactically conflated categories (cf.
also recent work by Eric Reuland) will be explored.
The three construction types are illustrated by the following
examples:
A. Clitic climbing:
(1) dass uns [1] der Hans vergessen hat [PRO e[1] sein Auto zu zeigen]
"that Hans has forgotten to show us his car"
B. "Long" passives:
(2) dass das Auto [1] vergessen wurde [(PRO) e[1] zu reparieren]
"that it was forgotten to repair the car"
C. Preposed verb clusters
(3) [zu reparieren vergessen] hat der Hans das Auto nicht
"Hans hasn't forgotten to repair the car"
Finally, the question is addressed of why subject control verbs as
well as some dative control verbs allow restructuring, while this is
never possible with accusative control verbs.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
How Many Real Numbers Are There?
Paul C. Gilmore
Department of Computer Science
University of British Columbia
Thursday, 15 February, 3:45 p.m.
Cordura 100
In this lecture, a natural deduction-based set theory NaDSet will be
used to provide a formal framework for logical foundations of category
theory admitting genuine instances of self-membership. However, usual
diagonal arguments leading to inconsistency are blocked, including
Cantor's argument for uncountability of the set of real numbers.
The following week, 22 February, David Israel will present material on
proof theory and meaning, inspired by chapter III.8 of the _Handbook of
Philosophical Logic_.
____________
SYMBOLIC SYSTEMS FORUM
Why are Computer Programs so Complicated?
John Lamping, Xerox PARC
(lamping.pa@xerox.com)
Thursday, 15 February, 4:15 p.m.
Building 60, Room 61G
One reason for the complexity of computer programs is that current
programming languages don't allow programmers to say what they mean.
Rather than letting the programmer say what a program is supposed to
accomplish, the languages force the programmer to give the computer a
set of instructions on what to do. The intent of the program is
relegated to the comments.
Functional programming and logic programming take a step in the right
direction, but a much smaller step than it might first appear. While
both approaches putatively let the programmer specify what the program
should compute, the catch is that the way the programmer writes down
the specification completely determines how (and thus how quickly) the
computer will compute the result. To get acceptable performance on
anything but toy programs, the description of the result usually must
be contorted into something that looks suspiciously like instructions
on how to compute the result. The intent of the program is still
relegated to the comments.
What if the description of what to compute could be decoupled from how
the result would be computed? It's a bit much to expect a system that
automatically figures out a good way to compute a result, but that job
can be left to the programmer. The programmer would give a high-level
description of what the result should be, and annotate that
description with instructions on how it should be implemented.
In this talk, I'll give some examples of what this kind of programming
might look like and suggest how to build a programming system that
supports it. In such a system, the programmer would talk explicitly
about the representation relationships within the program and between
the program and its implementation. The key to designing such a
system seems to be a good theoretical understanding of such
representation relationships.
The following week, 22 February, Philip Cohen, SRI International and
Stanford Linguistics, will talk. Title: Intention, Commitment, and
Communication.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Spinoza's Theory of Error
Yirmiahu Yovel
Hebrew University, Jerusalem
Friday, 16 February, 3:15 p.m.
Building 90, Room 92Q
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Contrary to earlier announcements, there will be no Linguistics
Department Colloquium this Friday, 16 February. John Nerbonne will
talk next Friday, 22 February, and the second meeting of the linking
symposium will be on Friday, 9 March.
____________
LANGUAGE ACQUISITION INTEREST GROUP
Temporality in Untutored Adult Second Language Acquisition:
Functional Approach to Data Analysis
Marya Teutsch-Dwyer
Tuesday, 20 February, 12:00 noon
Building 100, Greenberg Room
No abstract available.
____________
∂14-Feb-90 1709 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU California Competitive Technology Grants
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Feb 90 17:09:24 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17642; Wed, 14 Feb 90 17:09:56 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA05930; Wed, 14 Feb 90 17:03:35 PST
Date: Wed, 14 Feb 90 17:03:35 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002150103.AA05930@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: California Competitive Technology Grants
fyi:
----
Begin forwarded message:
Date: Wed, 14 Feb 90 11:41:37 PST
To: nilsson@score.stanford.edu
From: AS.BTH@forsythe.stanford.edu
Subject: California Competitive Technology Grants
California Competitive Technology Grants
Approximately $3.3 million is still available during the
current
fiscal year 1990 California Competitive Technology
Grant Program
(CompTech). The final proposal deadline is 4:00 PM,
April 13, 1990.
Applications for this year's solicitation must be submitted
complete, and not in two parts as last year.
The goal of this program, now in its second year of State
funding
though the Department of Commerce, is to "accelerate
market driven
innovation through public-private collaborative
technology transfer
projects". The ultimate goal of each funded project is to
have a
beneficial and cost-effective impact on the State's
economy.
The Joint Committee on Science and Technology,
chaired by Senator
John Garamendi, stated in its March 1988 Hearing on
Technology
Transfer that "technology transfer occurs when research
in
universities is provided to industries which can capitalize
on the
information to improve their processes or to create new
products."
This process, and subsequent funding, according to
State
representatives, will be industry driven.
Research areas can include, but are not limited to:
advanced
materials, biotechnology, computer science, automated
manufacturing,
electronics, energy development, medical technologies,
environmental
improvement, robotics, software, superconductivity,
prototype
development, field tests, and software codes.
Last year, 239 proposals were submitted to the program,
of which 29
projects were funded ranging from $6,400 to
$1,170,900. Stanford
received three awards, two of them in medicine, and one
in
microelectronics.
Fifty applications were received at the first semi-annual
deadline
of Dec. 15, 1989. It is conceivable, therefore, that more
than
$3.3 million (one-half of FY 90) CompTech funds are still
available.
University researchers need to establish private sector
support with
an industrial partner, which can be accomplished in
several ways:
1) Collaborative Research Projects; 2) Consortia
Developments; 3)
Entrepreneurial Business Developments; 4) Technology
Transfer
Innovation projects; or 5) Unsolicited proposals. The
intent is to
facilitate the transfer of basic research ideas into the
applied
marketplace.
Matching contributions are not required of Phase 0
projects, which
receive Discretionary Grants of up to $350,000 for one
year for the
development, including feasibility planning of a project.
Phase I
projects receive grants for up to one year, but require
matching
private sector support of AT LEAST one dollar for every
two dollars
of CompTech funds (which may be in-kind
contributions). Phase II
projects receive grants for at least one year and up to
three years
and must have a matching private sector contribution of
AT LEAST one
dollar for every one dollar of CompTech funding.
Applicants will be informed of funding decisions within
120 days of
the submission date, and funds made available to
awardees six months
after the evaluation deadline.
Please contact Bonnie Hale at 3-4237 or
as.bth@Forsythe for copy of
the solicitation.
To:
ENGNR(AS.DKG,AS.KCC,AS.PMC,BARNETT@SIERR
A,BSCOTT@SCORE,CANNON@SIERRA,
CMILLER@SIERRA,GOODMAN@SIERRA,HAGST
ROM@SIERRA,HF.JJC,HF.KXM,HF.RRK,
HOMSY@SIERRA,HUGHES@SIERRA,IGLEHART
@SIERRA,JEZUKEWICZ@SIERRA,
JPJ@SIERRA,LEVINTHAL@SIERRA,LUENBERGE
R@SIERRA,NILSSON@SCORE,
PALMER@ACROPOLIS,REYNOLDS@SCORE,RIN
ALDO@SIERRA,SHAH@SIERRA)
cc:
GUIDE(AR.PBC,AS.CFB,AS.CMS,AS.KAM,AS.NON,BL
ASCHKE@SUMEX-AIM,
BUSINGER@SUMEX-
AIM,CG.ECA,CG.MSP,CM.HPP,CM.PAF,CR.MTH,CV.T
IM,
DKG@SIERRA,FB.RMW,FE.DXC,HF.CMP,HF.EWL,
HF.JPK,HK.EGC,HK.PLD,LB.KND,
MA.DJC,MA.JAW,MA.RJJ,ME.DMG,ME.LWK,ML.CE
K,ML.JAN,ML.JMB,ML.KRK,ML.PEG,
ML.PMA,ML.RSE,ML.SKM,ML.TPB,MP.PXG,MR.LG
O,MS.KLW,MT.MJC,MU.MPL,MX.CLA,
PALMER@ACROPOLIS,RA.CLH,RINDFLEISCH@S
UMEX-AIM,ROSENHAN@PSYCH,RS.MMA,
SWIFT@SUMEX-AIM),
CR(AH.RAK,BERGMAN@POLYA,BUSINGER@SUME
X-AIM,CA.PAB,
CLEMENS@SIERRA,CM.HPP,CM.PAF,CR.MTH,DK
G@SIERRA,EQ.DLR,FA.ACB,FA.ASB,
FA.JCG,FAIRLIE@POLYA,FB.RMW,FE.DXC,FEHLI
NG@POLYA,FF.JSP,
GENESERETH@SCORE,HAGSTROM@SIERRA,H
F.AWL,HF.JNS,HF.JPK,HF.SAG,HK.PLD,
HOMSY@SIERRA,LB.KND,MA.DJC,ME.DMG,ME.L
WK,MG.ZSB,ML.CEK,ML.DSJ,ML.JMB,
ML.KRK,ML.PMA,ML.RSE,ML.SKM,ML.TPB,MR.LG
O,MS.ADM,MS.KLW,MU.MPL,
PALMER@ACROPOLIS,REYNOLDS@SCORE,RIN
ALDO@SIERRA,RS.MMA,SHAH@SIERRA,
SWIFT@SUMEX-
AIM,TCR@SUMEX,WALTER@SOL-
WALTER,WOLAK@SUWATSON), HK.PLD,
OS&
AS(AS.CFB,AS.CMS,AS.EDR,AS.GIJ,AS.GUS,AS.KAT,
AS.LAB,AS.LAR,AS.LJA,
AS.NON,AS.PAW,AS.RCB,AS.RMK,AS.SDG,AS.SK
G,AS.VGM,AS.VGS)
∂15-Feb-90 0747 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU LICS prelim prgrm
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 07:47:30 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA17776; Thu, 15 Feb 90 07:47:46 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25535; Thu, 15 Feb 90 07:47:30 -0800
Message-Id: <9002151547.AA25535@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5157; Thu, 15 Feb 90 09:11:46 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5127; Thu, 15 Feb 90 09:11:41 CST
Date: Thu, 15 Feb 90 09:10:40 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
LICS@B.GP.CS.CMU.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: LICS%B.GP.CS.CMU.EDU@VM1.NoDak.EDU
Subject: LICS prelim prgrm
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Preliminary Program
IEEE Symposium on Logic in Computer Science
June 4-7, Philadelphia, PA
Banquet Speaker: R.O. Gandy, Oxford
Special session on automated decuction (to be announced).
Technical papers grouped into prospective sessions
(order not yet determined):
NEW FOUNDATIONS FOR FIXPOINT COMPUTATIONS
Roy L. Crole and Andrew M. Pitts (Cambridge Univ.)
POLYMORPHISM, SET THEORY, AND CALL-BY-VALUE
Edmund Robinson (Queen's Univ.) and Giuseppe Rosolini (Univ. Parma)
UNIVERSAL DOMAINS IN THE THEORY OF DENOTATIONAL
SEMANTICS OF PROGRAMMING LANGUAGES
Manfred Droste and R\"udiger G\"obel (Univ. Essen)
THE CLASSIFICATION OF CONTINUOUS DOMAINS
Achim Jung (Technische Hochschule Darmstadt and Imperial College)
COMPLETENESS FOR TYPED LAZY EQUALITIES
Stavros Cosmadakis (IBM T.J. Watson),
Albert Meyer (MIT) and Jon Riecke (MIT)
TYPE RECONSTRUCTION IN FINITE-RANK FRAGMENTS OF
THE POLYMORPHIC $\lambda$-CALCULUS
A.J. Kfoury (Boston Univ.) and J. Tiuryn (Univ. Warsaw)
CONDITIONAL LAMBDA-THEORIES AND THE VERIFICATION
OF STATIC PROPERTIES OF PROGRAMS
Mitchell Wand and Zheng-Yu Wang (Northeastern Univ.)
SINGLE-THREADED POLYMORPHIC LAMBDA CALCULUS
Juan C. Guzman and Paul Hudak (Yale Univ.)
PROGRAMMING IN EQUATIONAL LOGIC: BEYOND STRONG SEQUENTIALITY
R.C. Sekar and I.V. Ramakrishnan (SUNY Stony Brook)
THE THEORY OF GROUND REWRITE SYSTEMS IS DECIDABLE
M. Dauchet and S. Tison (Univ. Lille-Flandres-Artois)
WELL REWRITE ORDERINGS
Pierre Lescanne (CRIN)
A CONSTRUCTIVE PROOF OF HIGMAN'S LEMMA
Chetan Murthy and James R. Russell (Cornell Univ.)
SYNTACTIC THEORIES AND UNIFICATION
Claude Kirchner and Francis Klay (INRIA Lorraine and CRIN)
PROOF TRANSFORMATIONS FOR EQUATIONAL THEORIES
Tobias Nipkow (Cambridge Univ.)
A NEW AC UNIFICATION ALGORITHM WITH A NEW ALGORITHM FOR
SOLVING DIOPHANTINE EQUATIONS
Alexandre Boudet, Evelyne Constejean and Herve Devie (Univ. Paris Sud)
ON SUBSUMPTION AND SEMIUNIFICATION IN FEATURE ALGEBRAS
Jochen D\"orre (Univ. Stuttgart) and William Rounds (Univ. Michigan)
SYMBOLIC MODEL CHECKING: $10↑20$ STATES AND BEYOND
J.R. Burch, E.M. Clarke and K.L. McMillan (CMU);
D.L. Dill and J. Hwang (Stanford)
WHEN IS "PARTIAL" ADEQUATE? A LOGIC-BASED PROOF TECHNIQUE
USING PARTIAL SPECIFICATIONS
Rance Cleaveland (North Carolina State Univ.) and Bernhard Steffen (Aarhus)
MODELLING SHARED STATE IN A SHARED ACTION MODEL
Kenneth J. Goldman and Nancy A. Lynch (MIT)
ON THE LIMITS OF EFFICIENT TEMPORAL DECIDABILITY
E. Allen Emerson (UT Austin and MCC), Mike Evangelist (MCC)
and Jai Srinivasan (UT Austin and MCC)
EQUATION SOLVING THROUGH AN OPERATIONAL SEMANTICS OF CONTEXT
Kim G. Larsen and Liu Xinxin (Aalborg)
THREE LOGICS FOR BRANCHING BISIMULATION
Rocco De Nicola (IEI - CNR) and Frits Vaandrager (CWI)
REACTIVE, GENERATIVE, AND STRATIFIED MODELS OF PROBABILISTIC PROCESSES
Rob van Glabbeek (CWI), Scott A. Smolka (SUNY Stony Brook),
B. Steffen (Aarhus) and Chris Tofts (Univ. Edinburgh)
THE NONEXISTENCE OF FINITE AXIOMATISATIONS FOR CCS CONGRUENCES
Faron Moller (Univ. Edinburgh)
A LOGIC OF CONCRETE TIME INTERVALS
Harry R. Lewis (Harvard Univ.)
REAL-TIME LOGICS: COMPLEXITY AND EXPRESSIVENESS
Rajeev S. Alur and Tom Henzinger (Stanford Univ.)
EXPLICIT CLOCK TEMPORAL LOGIC
Eyal Harel, Amir Pnueli and Orna Lichtenstein (Weizmann)
MODEL-CHECKING FOR REAL-TIME SYSTEMS
Rajeev Alur (Stanford), Costas Courcoubetis (AT\&T Bell Labs)
and David Dill (Stanford Univ.)
A DECISION PROCEDURE FOR A CLASS OF SET CONSTRAINTS
Nevin Heintze (CMU) and Joxan Jaffar (IBM T.J. Watson)
A CONSTRAINT SEQUENT CALCULUS
Jean-Louis Lassez (IBM T.J. Watson) and
Ken McAloon (Brooklyn College and CUNY Graduate Center)
SOLVING INEQUATIONS IN TERM ALGEBRAS
H. Comon (Univ. Paris Sud)
THE DYNAMIC LOGIC OF PERMISSION
R. van der Meyden (Rutgers Univ.)
A THEORY OF NON-MONOTONIC RULE SYSEMS
Wiktor Marek (Univ. Kentucky) and Anil Nerode (Cornell Univ.)
THE SEMANTICS OF REFLECTED PROOF
Stuart F. Allen, Robert L. Constable, Douglas J. Howe and
William E. Aitken (Cornell Univ.)
ON THE POWER OF BOUNDED CONCURRENCY: REASONING ABOUT PROGRAMS
David Harel (Weizmann Inst.), Roni Rosner (Weizmann Inst.)
and Moshe Vardi (IBM Almaden)
NORMAL PROCESS REPRESENTATIVES
Vijay Gehlot and Carl Gunter (Univ. Pennsylvania)
A CATEGORIAL LINEAR FRAMEWORK FOR PETRI NETS
Carolyn Brown and Doug Gurr (Univ. Edinburgh)
A LINEAR SEMANTICS FOR ALLOWED LOGIC PROGRAMS
Serenella Cerrito (Univ. Paris XI)
0-1 LAWS FOR INFINITARY LOGICS
Phokion Kolaitis (UC Santa Cruz) and Moshe Vardi (IBM Almaden)
IMPLICIT DEFINABILITY ON FINITE STRUCTURES AND UNAMBIGUOUS COMPUTATIONS
Phokion Kolaitis (UC Santa Cruz)
ALOGTIME AND A CONJECTURE OF S.A. Cook
Peter Clote (Boston College)
ON THE EXPRESSION OF MONADIC SECOND-ORDER GRAPH PROPERTIES
WITHOUT QUANTIFICATIONS OVER SETS OF EDGES
Bruno Courcelle (Univ. Bordeaux I)
EXTENSIONAL PERS
P. Freyd (Univ. Pennsylvania), P. Mulry (Colgate),
G.Rosolini (Univ. Parma), D. Scott (CMU)
RECURSIVE TYPES REDUCED TO INDUCTIVE TYPES
Peter Freyd (Univ. Pennsylvania)
A PER MODEL OF POLYMORPHISM AND RECURSIVE TYPES
M. Abadi (DEC SRC) and G. D. Plotkin (Univ. Edinburgh)
EFFECTIVE DOMAINS AND INTRINSIC STRUCTURE
Wesley Phoa (Cambridge Univ.)
General chair: Albert R. Meyer
Conference chair: Jean Gallier
Program Chair: John C. Mitchell
Program committee: K. Apt, J. Barwise, E. Clarke, S. Cook, S. Hayashi,
P. Kanellakis, J.-P. Jouannaud, D. Leivant, J. Mitchell, U. Montanari,
A. Pitts, E. Sandewall, A. Scedrov, M. Stickel, G. Winskel
For further conference information, send electronic mail
to lics@cs.cmu.edu.
∂15-Feb-90 0747 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU COLT '90 Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 07:47:42 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA17783; Thu, 15 Feb 90 07:47:59 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25538; Thu, 15 Feb 90 07:47:53 -0800
Message-Id: <9002151547.AA25538@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7646; Thu, 15 Feb 90 09:27:36 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7628; Thu, 15 Feb 90 09:27:34 CST
Date: Thu, 15 Feb 90 09:26:48 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
fulk@cs.rochester.edu
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: fulk%cs.rochester.edu@VM1.NoDak.EDU
Subject: COLT '90 Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
COLT '90
Third Workshop on Computational Learning Theory
Rochester, NY
August 6 - August 8, 1990
The third workshop on Computational Learning Theory will be held in
Rochester, NY. The conference will be jointly sponsored by SIGACT and
SIGART, and is expected to be similar in style to the previous such
workshops held at MIT and UC/Santa Cruz. Registration at COLT '90 is open.
It is expected that most papers will present rigorous formal analyses
of theoretical issues in Machine Learning. Possible topics include,
but are not limited to: resource and robustness analysis of learning
algorithms, general learnability and non-learnability results in new and
existing computational learning models, theoretical comparisons among
learning models, and papers that connect learning theory with work in
robotics, neural nets, pattern recognition and cryptography. R. Freivalds
(Latvian State University, Riga) has agreed to present an invited talk;
the program committee may consider more such.
Authors should submit an extended abstract that consists of:
A) cover page with title, authors' names,
(postal and e-mail) addresses, and a 200 word summary.
B) body not longer than 10 pages in twelve-point font.
Be sure to include a clear definition of the model used, an overview
of the results, and some discussion of their significance, including
comparison to other work. Proofs or proof sketches should be included
in the technical section. Authors should send 10 copies of their
abstract to
John Case
COLT '90
Department of Computer and Information Sciences
103 Smith Hall
University of Delaware
Newark, DE 19716.
The deadline for receiving submissions is April 9, 1990. This deadline
is FIRM. Authors will be notified by May 22, final camera-ready papers
will be due June 18, and this deadline is ABSOLUTE. The proceedings will
be published by Morgan-Kaufmann. For further information about submissions
contact John Case (telephone: 302-451-2711, email: case@cis.udel.edu).
Chair and local arrangements: Mark A. Fulk (U. Rochester).
Program committee:
J. Case (Delaware, chair),
D. Angluin (Yale),
E. Baum (NEC Research, Princeton)
S. Ben David (Technion, Israel),
M. Fulk (U. Rochester),
D. Haussler (UC Santa Cruz),
L. Pitt (U. Illinois),
R. Rivest (MIT),
C. Smith (Maryland),
S. Weinstein (U. Pennsylvania).
Note: papers that have appeared in journals or that are being submitted
to other conferences are not appropriate for submission to COLT with the
exception of papers submitted to the IEEE 30th Symposium on Foundations of
Computer Science (FOCS).
A joint submission policy coordinated with FOCS permits authors to send
a paper to both conferences; in the event that both conferences accept the
paper, it will be published in the FOCS proceedings, the authors will be
invited to give a talk at both conferences, and a short (one-page) abstract
will be printed in the COLT proceedings.
As the FOCS decisions may be quite late, authors of dual submissions
will be asked to send the abstract with their final copy, so as to
allow the publisher to substitute the abstract upon receiving word of
the FOCS decision.
It is, of course, required that authors notify both committees of the
dual submission by including a note in the cover letters.
∂15-Feb-90 0858 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : California Competitive Technology
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 08:54:43 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26656; Thu, 15 Feb 90 08:54:41 -0800
Date: Thu, 15 Feb 1990 8:54:40 GMT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: [AS.BTH@Forsythe.Stanford.EDU : California Competitive Technology
Grants ]
Message-Id: <CMM.0.88.635100880.bergman@Sunburn.Stanford.EDU>
Following is a message from our Sponsored Projects Office describing
a research opportunity. I have requested a copy of the solicitation,
so let me know if you would like a copy for yourself.
-Sharon Bergman
Return-Path: <AS.BTH@Forsythe.Stanford.EDU>
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05398; Wed, 14 Feb 90 11:40:45 -0800
Message-Id: <9002141940.AA05398@Sunburn.Stanford.EDU>
Date: Wed, 14 Feb 90 11:38:59 PST
To: bergman@CS.Stanford.EDU
From: AS.BTH@Forsythe.Stanford.EDU
Subject: California Competitive Technology Grants
California Competitive Technology Grants
Approximately $3.3 million is still available during the current
fiscal year 1990 California Competitive Technology Grant Program
(CompTech). The final proposal deadline is 4:00 PM, April 13, 1990.
Applications for this year's solicitation must be submitted
complete, and not in two parts as last year.
The goal of this program, now in its second year of State funding
though the Department of Commerce, is to "accelerate market driven
innovation through public-private collaborative technology transfer
projects". The ultimate goal of each funded project is to have a
beneficial and cost-effective impact on the State's economy.
The Joint Committee on Science and Technology, chaired by Senator
John Garamendi, stated in its March 1988 Hearing on Technology
Transfer that "technology transfer occurs when research in
universities is provided to industries which can capitalize on the
information to improve their processes or to create new products."
This process, and subsequent funding, according to State
representatives, will be industry driven.
Research areas can include, but are not limited to: advanced
materials, biotechnology, computer science, automated manufacturing,
electronics, energy development, medical technologies, environmental
improvement, robotics, software, superconductivity, prototype
development, field tests, and software codes.
Last year, 239 proposals were submitted to the program, of which 29
projects were funded ranging from $6,400 to $1,170,900. Stanford
received three awards, two of them in medicine, and one in
microelectronics.
Fifty applications were received at the first semi-annual deadline
of Dec. 15, 1989. It is conceivable, therefore, that more than
$3.3 million (one-half of FY 90) CompTech funds are still available.
University researchers need to establish private sector support with
an industrial partner, which can be accomplished in several ways:
1) Collaborative Research Projects; 2) Consortia Developments; 3)
Entrepreneurial Business Developments; 4) Technology Transfer
Innovation projects; or 5) Unsolicited proposals. The intent is to
facilitate the transfer of basic research ideas into the applied
marketplace.
Matching contributions are not required of Phase 0 projects, which
receive Discretionary Grants of up to $350,000 for one year for the
development, including feasibility planning of a project. Phase I
projects receive grants for up to one year, but require matching
private sector support of AT LEAST one dollar for every two dollars
of CompTech funds (which may be in-kind contributions). Phase II
projects receive grants for at least one year and up to three years
and must have a matching private sector contribution of AT LEAST one
dollar for every one dollar of CompTech funding.
Applicants will be informed of funding decisions within 120 days of
the submission date, and funds made available to awardees six months
after the evaluation deadline.
Please contact Bonnie Hale at 3-4237 or as.bth@Forsythe for copy of
the solicitation.
∂15-Feb-90 1111 @Sunburn.Stanford.EDU:dill@amadeus.Stanford.EDU Systems students?
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 11:10:56 PST
Received: from Amadeus.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01431; Thu, 15 Feb 90 11:11:16 -0800
Received: by amadeus.Stanford.EDU (5.57/Ultrix2.4-C)
id AA17326; Thu, 15 Feb 90 11:13:04 PST
Date: Thu, 15 Feb 90 11:13:04 PST
From: dill@amadeus.Stanford.EDU (David Dill)
Message-Id: <9002151913.AA17326@amadeus.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Systems students?
Perhaps you have some students that would like to apply to this:
From Eric.Cooper@N.SP.CS.CMU.EDU Thu Feb 15 08:36:01 1990
Received: from Messages.7.10.N.CUILIB.3.45.SNAP.NOT.LINKED.N.SP.CS.CMU.EDU.vax.22
via MS.5.6.N.SP.CS.CMU.EDU.vax_22;
Thu, 15 Feb 90 11:31:11 -0500 (EST)
Message-Id: <4ZqhZDW00j850NanA_@cs.cmu.edu>
Date: Thu, 15 Feb 90 11:31:11 -0500 (EST)
From: Eric.Cooper@CS.CMU.EDU
To: cheriton@Pescadero.STANFORD.EDU, dill@AMADEUS.STANFORD.EDU
Subject: graduating systems PhDs?
Status: R
Hello, David(s). I'm co-chairing our faculty search committee for the
systems area this year, and it looks like we'll have two slots to fill.
Ideally, one would be in experimental (SOSP-style) distributed systems,
and the other in more theoretical (i.e. PODC or POPL-style) systems. If
you think any of Stanford's graduating PhDs might fit the bill, please
have them consider applying to CMU. Thanks.
Cheers,
Eric
I get requests from time to time like this. Is there a better
way to find a list of students who might be appropriate?
∂15-Feb-90 1136 LOGMTC-mailer Mints seminar series
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
There will be a series of lectures by visiting logician Grigori Mints
to be held Wednesday noons in Margaret Jacks 352 beginning next week.
The data for the first talk is given below.
------------------------
Speaker: Grigori Mints, Institute of Cybernetics, Tallinn 200108, Estonia
Title: Resolution Calculi for Propositional Modal Logic
Time: Noon, Wednesday February 21, 1990
Place: 352 Margaret Jacks Hall (Stanford Computer Science)
Abstract:
We present resolution-type calculi for several propositional
modal logics, including S5, S4, T and K, and prove their completeness.
The method provides a general scheme for transforming a cutfree
Gentzen-type propositional system into a resolution-type system
preserving the structure of derivations. This is a direct extension
of the method introduced by Maslov for classical predicate logic.
The use of this transformation allows us to simplify drastically
the resolution formulations of modal logics, and to obtain a new proof
of the completeness of resolution-type calculus for intuitionistic
logic.
∂15-Feb-90 1331 mrg@Sunburn.Stanford.EDU parking
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 13:31:03 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07756; Thu, 15 Feb 90 13:31:15 -0800
Date: Thu, 15 Feb 1990 13:31:14 GMT
From: Michael Genesereth <mrg@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: parking
Message-Id: <CMM.0.88.635117474.mrg@Sunburn.Stanford.EDU>
Folks,
I have found it more and more difficult of late to find
parking near Jacks other than in the earlky morning. Even noonish
is getting more difficult. I am speaking here of A parking. It is extremely
aggravating to drive around the oval, then the various outlying parking
areas, ultimately ending up around the parking structure. I do not
mind walking but often I am in a rush and often I have lots of things
to carry. If anyone else shares these problems, let me know and I will
look into the problem. (I have a few ideas on how things might be eased.)
If no one shares the problem, I will just shut up about it. Please send
me a note IF you think there is a problem to be solved.
mrg
∂15-Feb-90 1426 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 20 February, 7:30
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 14:26:03 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA22178; Thu, 15 Feb 90 13:57:50 PST
Date: Thu, 15 Feb 90 13:57:50 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9002152157.AA22178@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Syntax Workshop, Tuesday, 20 February, 7:30
SYNTAX WORKSHOP
Gender-Shifting in Literary Sinhala as a Discourse Marker
John Paolillo
(johnp@csli.stanford.edu)
Tuesday, 20 February, 7:30 p.m.
Cordura 100
Recent work by Bresnan and Kanerva (1989) has begun to highlight the
role of grammatical gender (noun classification) in defining the
syntactic properties of a language. In this talk, I will discuss the
system of gender in Literary Sinhala, and some potential consequences
for a theory of grammar. In particular, I will look at a phenomenon I
call "gender-shifting," its discourse-conditioning, and grammatical
consequences.
Literary Sinhala has a system of grammatical gender involving two main
categories that can be notionally defined: animate and inanimate. The
gender of a noun determines its possibilities for agreement and case
marking: inanimate nouns do not have distinct nominative and
accusative case forms, and they cannot control number agreement in
subject-verb agreement. There is an unmistakable partition between
animate and inanimate nouns in the case forms that they receive as
well, and inanimate nouns that function as subjects of transitive
verbs cannot passivize, although animate subjects of the same verbs
do.
However, Literary Sinhala allows inanimate nouns to be inflected as
animate nouns in certain situations; in such cases, the inanimate
nouns take the case forms and terminations of animate nouns, and they
trigger plural verb agreement as well. Gender-shifted inanimate nouns
also passivize. For all purposes, they are grammatically animate
nouns. The traditional explanation for this is that gender-shifting
is a metaphorical process, whereby inanimate beings are metaphorically
treated as animate beings, "for poetic effect." This explanation is
challenged, however, by observations in Perera (1983), who
demonstrates that even gender-shifted inanimate nouns do not behave
like animate nouns in certain semantic tests, e.g., volitionality
tests.
In this talk, I suggest that for modern Sinhala at least, the metaphor
explanation of gender-shifting is incorrect, and that gender-shifting
of inanimate nouns is used to foreground discourse central inanimate
nouns. Other inanimate nouns are not gender-shifted. The explanation
I offer is that Literary Sinhala crucially employs "grammatical
animacy" (as distinct from semantic animacy) in relating the
grammatical relations borne by nouns to their status in the discourse.
Gender-shifting is a grammatical process that indexes the discourse
status of inanimate NPs. Discourse prominence, in turn, is a
prerequisite for bearing certain grammatical relations, e.g., subject.
The data presented and the analysis thereof illustrate the crucial
role of discourse factors in sentence-internal grammatical relations,
and the need for a theory that can explicate those relations.
References:
Bresnan, Joan, and Kannerva, Jonni. 1989. Locative Inversion in
Chichewa: A Case Study of Factorization in Grammar, LI 20.1, 1-50.
Perera, J. A. Y. 1983. "Lekhana Sinhalayee Prathama, Karma, Kartr
yana Vibhakti tuna" (The Three Cases, Nominative, Accusative, and
Agentive, in Written Sinhala; article in Sinhala). Samskrti Cultural
Quarterly, vol. 17, no. 4, D. E. Hettiaratchi felicitation volume,
Ministry of Plan Implementation, Colombo, 84-96.
-----
The next workshop will be Tuesday, 20 March. Alex Alsina will present
"Where's the Mirror Principle? Evidence from Chichewa," the paper he
will be giving shortly after at GLOW.
∂15-Feb-90 1459 helen@russell.Stanford.EDU Internship lunch
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 14:59:36 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA22885; Thu, 15 Feb 90 15:00:54 PST
Date: Thu 15 Feb 90 15:00:52-PST
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: Internship lunch
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <635122852.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
TO: SSP FACULTY
SUBJECT: INTERNSHIP INFORMATIONAL LUNCH
We're making plans to hold an informational lunch meeting for SSP faculty
and SSP students interested in participating in the CSLI-SSP internship
program. The most likely date is March 5, at noon, in the Cordura Hall
Conference Room.
At the meeting, faculty who are interested in sponsoring student interns, will
be given the opportunity to give a brief description of their projects and
the nature of the proposed internships. We'll follow a program simllar to
that of last year's informational meeting.
We invite all of you with RA/internship/summer job possibilities to attend.
If you would like to attend the meeting, I would appreciate hearing from your.
If you cannot make the meeting, but have work possibilities, I would like
hearing from you, too.
Thanks!
Helen
-------
∂15-Feb-90 1508 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU summary of replies to Data Structures and Algorithms text request
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 15:08:37 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19588; Thu, 15 Feb 90 15:08:07 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15083; Thu, 15 Feb 90 15:06:35 -0800
Message-Id: <9002152306.AA15083@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0987; Thu, 15 Feb 90 17:03:12 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0973; Thu, 15 Feb 90 17:03:09 CST
Date: Thu, 15 Feb 90 17:02:10 CST
Reply-To: tompa%geoduck.cs.washington.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: tompa%geoduck.cs.washington.edu@VM1.NoDak.EDU
Subject: summary of replies to Data Structures and Algorithms text request
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Last week I posted a request for a good undergraduate textbook on data
structures and algorithms that would pass 2 tests:
1. It covers most or all of the standard material.
2. It practices (as opposed to preaching) abstract data types.
I received about 40 replies, of which perhaps 35 said they were also
dissatisfied with their current choice and could I please post a
summary of the responses. Here it is. Thanks to all of you for your help.
a. A few people pointed to algorithm texts such as Baase's and
Sedgewick's, which didn't seem to satisfy my needs, since they don't
really treat abstract data types.
b. A few people pointed to Stubbs and Webre; detailed remarks from one
of them are attached below. It looks good to me, but I agree that it
is too elementary for the class I am teaching.
c. Clark Thomborson pointed out Decker's "Data Structures"
(Prentice-Hall, 1989) as passing both my criteria. It looks to me as
though it does, so I'm going to give it a try next quarter. I will
post another message in the summer giving my assessment after testing it in
class.
d. There are 2 books in progress that were pointed out as possibly
filling the gap in the future: one by Wood, and one by Denenberg and Lewis.
----------------------------------------------------------
To: tompa@cs.washington.edu
Subject: Re: textbook on data structures and algorithms
In-Reply-To: Your message of Mon, 05 Feb 90 19:27:01 -0600.
I've taught a data structures course here and used a book called
"Data Structures with Abstract Data Types and Pascal", by
Stubbs and Webre, Brooks/Cole Publishing Company, 1989.
I recommend it with reservations; it partially meets your two tests
but is not perfect.
Other that union-find, I think it contains all the material you
mention in test 1.
I like the approach to abstract data types in the book for the most part,
though Pascal is not the best language to use in discussing abstract
data types.
Problems with the book: I'm not sure what level of student you intend
the book for. We use it in a course directly after the introductory
programming course, where we still need to spend time on basic
programming concepts such as pointers, recursion. The book is aimed at
this level, not for a senior level algorithms course. (This isn't a
problem if you're using it with students with the same level of
experience as we are).
There is a lot of code in the book. Some of it has bugs, mainly
due to the fact that it has been translated from some other
language.
There is little or no formal analysis of algorithms.
Big-O notation is used and informal arguments about the
running times of algorithms are included.
∂15-Feb-90 1543 LOGMTC-mailer tuesday seminar
Received: from Vashti.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Feb 90 15:43:15 PST
Received: by Vashti.Stanford.EDU (5.61/25-eef) id AA07632; Thu, 15 Feb 90 15:39:41 -0800
Date: Thu, 15 Feb 90 15:39:41 -0800
From: Dinesh H. Katiyar <katiyar@Vashti.Stanford.EDU>
Message-Id: <9002152339.AA07632@Vashti.Stanford.EDU>
To: logmtc@sail.stanford.edu
Subject: tuesday seminar
-----------------------------------------------------------------------------
tuesday seminar
20th february
4:15 pm, mjh 301
-----------------------------------------------------------------------------
AN ALGEBRAIC AXIOMATIZATION OF LINEAR LOGIC MODELS
NARCISO MARTI-OLIET
SRI International and CSLI
Abstract:
A new algebraic axiomatization of linear logic models is presented. The
axioms directly reflect at the model-theoretic level the de Morgan duality
exhibited by linear logic, and are considerably simpler than previous
axioms. Several equationally defined classes of models are studied. One
such class suggests a new variant of linear logic, called cancellative
linear logic, in which it is always possible to cancel a proposition P
(viewed as a resource) and its negation P↑{\bot} (viewed as a debt.) This
provides a semantics for a generalization of the usual token game on Petri
nets, called financial game. Poset models, called Girard algebras,
are also defined equationally; they generalize for linear logic the Boolean
algebras of classical logic, and contain the quantale models as a
special case. The proposed axiomatization also provides a simple set of
categorical combinators for linear logic, extending those previously
proposed by Lafont.
This is joint work with JOSE MESEGUER.
-----------------------------------------------------------------------------
∂16-Feb-90 1154 peters@russell.Stanford.EDU Re: Internship lunch
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Feb 90 11:53:38 PST
Received: from localhost by russell.Stanford.EDU (4.1/inc-1.0)
id AA27301; Fri, 16 Feb 90 08:45:41 PST
Message-Id: <9002161645.AA27301@russell.Stanford.EDU>
To: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Cc: ssp-faculty@russell.Stanford.EDU, debra@russell.Stanford.EDU
Subject: Re: Internship lunch
In-Reply-To: Your message of Thu, 15 Feb 90 15:00:52 PST.
<635122852.0.HELEN@CSLI.Stanford.EDU>
Date: Fri, 16 Feb 90 08:45:39 PST
From: peters@russell.Stanford.EDU
Helen,
I'll be at the TARK III conference March 5-7 and thus unable to
participate in an SSP internship lunch on that Monday. If I have a
definite work opportunity to offer by that time, I'll try and get some
information into your hands before the lunch.
Stanley
∂16-Feb-90 1215 LOGMTC-mailer MSRI Seminar Announcements, Feb 19-23
Received: from msri.org (euclid.msri.org) by SAIL.Stanford.EDU with TCP; 16 Feb 90 12:15:13 PST
Received: by msri.org (AIX 2.1.2/s2.2)
id AA04087; Fri, 16 Feb 90 12:09:09 PST
Date: Fri, 16 Feb 90 12:09:09 PST
From: david@msri.org (David Mostardi)
Message-Id: <9002162009.AA04087@msri.org>
To: weekly@msri.org
Subject: MSRI Seminar Announcements, Feb 19-23
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 Centennial Drive * Berkeley, CA 94720 * (415) 642-0143
Seminar Announcements for the period
February 19 - 23, 1990
Monday, February 19
HOLIDAY-- Presidents' Day
Tuesday, February 20
ALGEBRAIC TOPOLOGY 10:00 MSRI Lecture Hall
J. Jones "Topology and Quantum Field Theories I "
MODEL THEORY 1:00 MSRI Seminar Room
A. Lachlan "Complete, Coinductive Theories (II)"
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
W. Hsiang "Cyclotomic Trace Map I"
SET THEORY 3:30 MSRI Lecture Hall
C. Montenegro "Ideals on Large Cardinals"
Wednesay, February 21
ALGEBRAIC TOPOLOGY 10:00 MSRI Lecture Hall
N. Yagita "Chern classes of Cohomology of p-groups of rankp 2 2"
RECURSION THEORY 1:30 MSRI Lecture Hall
A. Lachlan "The Density of the Enumeration Degrees"
MODEL THEORY SEMINAR 3:30 MSRI Lecture Hall
S. Fajardo "Model Theory of Stochastic Processes"
Thursday, February 22
ALGEBRAIC TOPOLOGY 9:30 MSRI Lecture Hall
J. Jones "Topology and Quantum Field Theories II"
LOGIC SEMINAR 11:00 MSRI Lecture Hall
M. Van Lambalgen "Axioms for Independence with Applications
to Set Theory and Generalized Quantifiers"
CENTER FOR PURE & APPLIED MATHEMATICS LUNCH TALK
12:10 (Bring your lunch)
12:45 Faculty Club Conf. Rm.
R. Packard "How to Measure the Earth's Rotation
By Using Quantum Mechanics"
MODEL THEORY 1:00 MSRI Seminar Room
A. Lachlan "Complete, Coinductive Theories (III) "
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
T. Goodwillie "Cyclotomic Trace Map II"
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
J. Marsden "Symmetry and Reduction in Mechanics"
Friday, February 23
AREA III SEMINAR 11:00 MSRI Seminar Room
H. Urakawa "Can you hear the shape of a drum? Hilbert's 18th problem and eigenvalues of the Laplacian "
∂16-Feb-90 1458 davis@Sunburn.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Feb 90 14:58:01 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16266; Fri, 16 Feb 90 11:55:53 -0800
Date: Fri, 16 Feb 1990 11:55:53 GMT
From: "Thea E. Davis" <davis@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Cc: Gilbertson@Sunburn.Stanford.EDU
Message-Id: <CMM.0.88.635198153.davis@Sunburn.Stanford.EDU>
∂16-Feb-90 1507 davis@Sunburn.Stanford.EDU Graphics Gathering Saturday
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Feb 90 15:07:31 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16547; Fri, 16 Feb 90 12:06:03 -0800
Date: Fri, 16 Feb 1990 12:06:03 GMT
From: "Thea E. Davis" <davis@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Subject: Graphics Gathering Saturday
Message-Id: <CMM.0.88.635198763.davis@Sunburn.Stanford.EDU>
Reminder -
The Graphics Gathering and Home Brewing
Creativy Club invites you to attend their
gathering tomorrow at Fairchild from 1 - 7.
The CS Dept is co-sponsor, and it's free.
You're welcome to bring friends and family.
Something for everyone, including kids.
Join 500 innovative people! Come & enjoy.
∂16-Feb-90 1619 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Feb 90 16:19:08 PST
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA04990; Fri, 16 Feb 90 16:05:49 PST
Date: Fri 16 Feb 90 16:05:48-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <635213148.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, February 22, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Phil Cohen, SRI International
Topic: "Intention, Commitment, and Communication"
ABSTRACT
--------
It is often said that language is a special case of
human action; theories of individual action should have
something interesting to say about how language is used.
This talk will sketch an analysis of intention and action,
will apply that analysis to something as simple as a
request, and then show why it fails to capture some common
properties of dialogue. I will conclude with a brief theory
of joint (i.e., collective or collaborative) activity, and
show why it is a better basis for describing dialogue than
speech act theory.
Following week, March 1:
Pat Hayes, Computer Science, Xerox PARC
"Time Points or Time Intervals? Problems in
Axiomatising Common Sense"
-------
∂16-Feb-90 2121 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Feb 90 21:20:59 PST
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA04990; Fri, 16 Feb 90 16:05:49 PST
Date: Fri 16 Feb 90 16:05:48-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <635213148.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, February 22, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Phil Cohen, SRI International
Topic: "Intention, Commitment, and Communication"
ABSTRACT
--------
It is often said that language is a special case of
human action; theories of individual action should have
something interesting to say about how language is used.
This talk will sketch an analysis of intention and action,
will apply that analysis to something as simple as a
request, and then show why it fails to capture some common
properties of dialogue. I will conclude with a brief theory
of joint (i.e., collective or collaborative) activity, and
show why it is a better basis for describing dialogue than
speech act theory.
Following week, March 1:
Pat Hayes, Computer Science, Xerox PARC
"Time Points or Time Intervals? Problems in
Axiomatising Common Sense"
-------
∂18-Feb-90 2220 jones@Sunburn.Stanford.EDU white boards in sitn lecture hall?
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Feb 90 22:20:12 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20479; Sun, 18 Feb 90 22:20:21 -0800
Date: Sun, 18 Feb 1990 22:20:20 GMT
From: "H. Roy Jones" <jones@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: white boards in sitn lecture hall?
Message-Id: <CMM.0.88.635408420.jones@Sunburn.Stanford.EDU>
SITN is thinking of putting white boards in a ~120 person room they are
converting for tv use. Anyone have a strong opinion on white boards vs.
blackboards for large lecture classes?
Roy
∂19-Feb-90 2038 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU This week's seminar
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Feb 90 20:38:04 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA20978; Mon, 19 Feb 90 20:35:41 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-eef) id AA06018; Mon, 19 Feb 90 20:35:02 -0800
Message-Id: <9002200435.AA06018@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: This week's seminar
Date: Mon, 19 Feb 90 20:34:59 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
AFLB will meet this week at its usual time and place: Thursday, 12:00pm,
in MJH 252. The speaker will be Eli Gafni.
Bootstrap Network Resynchronization:
An efficient Technique for End-to-end Communication
Eli Gafni
Computer Science Department
UCLA and Tel-Aviv University.
Many fault tolerant network-communication algorithms rely on the
ability of the network nodes to distinguish between ``old'' and
``new'' messages. Usually such algorithms accomplish this distinction
by time-stamping messages, and hence have unbounded complexity. Here
we give an efficient technique to achieve this distinction, without
time-stamps, in the weakest model of dynamic networks. The technique
supports the growth of a ``resynchronized territory'' around a
resynchronization initiator. ``Old'' messages that try to enter the
resynchronized territory are recognized as such. The correctness of
the process of enlarging the territory hinges on the fact that the
territory is already resynchronized and relays only ``new'' messages,
hence the name ``Bootstrap-Resynchronization.'' We apply the
technique to the end-to-end communication problem to yield an $O(nE)$
message complexity algorithm. Although the best previous algorithm
for this problem [AMS 89] has polynomial message complexity, its
complexity is too high to render it practical.
(Joint work with Yehuda Afek, TAU)
∂19-Feb-90 2212 LOGMTC-mailer tuesday seminar reminder
Received: from Vashti.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Feb 90 22:11:55 PST
Received: by Vashti.Stanford.EDU (5.61/25-eef) id AA10093; Mon, 19 Feb 90 22:08:03 -0800
Date: Mon, 19 Feb 90 22:08:03 -0800
From: Dinesh Katiyar <katiyar@Vashti.Stanford.EDU>
Message-Id: <9002200608.AA10093@Vashti.Stanford.EDU>
To: logmtc@sail.stanford.edu
Subject: tuesday seminar reminder
-----------------------------------------------------------------------------
tuesday seminar
20th february
4:15 pm, mjh 301
-----------------------------------------------------------------------------
AN ALGEBRAIC AXIOMATIZATION OF LINEAR LOGIC MODELS
NARCISO MARTI-OLIET
SRI International and CSLI
-----------------------------------------------------------------------------
∂20-Feb-90 1018 eisensee@sierra.Stanford.EDU Solid State Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 10:18:30 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Tue, 20 Feb 90 10:13:57 PST
Date: Tue, 20 Feb 90 10:13:57 PST
From: eisensee@sierra.Stanford.EDU (Sandra K. Eisensee)
To: ee-faculty@sierra, cis-people@glacier
Cc: eisensee@sierra.Stanford.EDU
Subject: Solid State Seminar
Message-Id: <CMM.0.88.635537636.eisensee@>
SOLID STATE LAB SEMINAR
AKA EE 430
TIME: 4:00pm REFRESHMENTS
4:15pm TALK STARTS
PLACE: AEL 109
DATE: FEBRUARY 21, 1990
Michael H. Hecht
Center for Space Microelectronics Technology
Jet Propulsion Laboratory
California Institute of Technology
NEW DEVELOPMENTS IN BALLISTIC ELECTRON EMISSION MICROSCOPY
BEEM is a three terminal Scanning Tunneling Microscopy Technique for
probing subsurface interface structure, as well as transport characteristics
of electrons and holes. New developments in BEEM will be reviewed, including
temperature-dependent Schottky barrier measurements, microscopy and
spectroscopy of ballistic holes, and spectroscopy of inelastically scattered
carriers.
∂20-Feb-90 1106 chandler@Sunburn.Stanford.EDU Today's faculty lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 11:06:00 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11778; Tue, 20 Feb 90 11:04:12 -0800
Date: Tue, 20 Feb 1990 11:04:11 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Today's faculty lunch
Message-Id: <CMM.0.88.635540651.chandler@Sunburn.Stanford.EDU>
Just to let you all know that there is no formal topic for today's faculty
lunch....but please do come on by and join in for a "topicless" discussion
and lunch.
∂20-Feb-90 1146 chandler@Sunburn.Stanford.EDU CSD Retreat
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 11:46:09 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13753; Tue, 20 Feb 90 11:46:16 -0800
Date: Tue, 20 Feb 1990 11:46:16 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: CSD Retreat
Message-Id: <CMM.0.88.635543176.chandler@Sunburn.Stanford.EDU>
It's time to decide on a place to hold this year's CSD retreat. Please let
me know if you have any ideas of a new place to hold it....or if you were
pleased with Chaminade. Thanks for your thoughts.
∂20-Feb-90 1430 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Time to set dates for 1991
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 14:30:07 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18761; Tue, 20 Feb 90 14:29:59 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA26043; Tue, 20 Feb 90 14:29:44 -0800
Date: Tue, 20 Feb 1990 14:29:42 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@Hudson.Stanford.EDU, faculty-csl@sierra.Stanford.EDU
Subject: Time to set dates for 1991
Cc: hiller@Hudson.Stanford.EDU
Message-Id: <CMM.0.88.635552982.tajnai@Hudson.Stanford.EDU>
We had many complaints about the meeting falling during Valentine's
week again this year. The meeting used to be held the first week of
February, but we conflicted with the SOE Visiting Committee. The
third week is not a good choice because of the Monday holiday.
Look at your calendar for 1991 and tell me which dates you prefer:
February 5-7 (and we will try to persuade SOE not to schedule their
Visiting Committee in conflict with our schedule.)
February 26-28
It is important to settle the dates quickly so we can reserve space.
Carolyn Tajnai
∂20-Feb-90 1617 chandler@Sunburn.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 16:16:20 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22628; Tue, 20 Feb 90 16:16:00 -0800
Date: Tue, 20 Feb 1990 16:16:00 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Publication
Message-Id: <CMM.0.88.635559360.chandler@Sunburn.Stanford.EDU>
I've just received a publication from NSF entitled "Coordination Theory and
Collaboration Technology" Special Initiative - Proposal Deadline 4/9/90. Let
me know if you're interested in seeing this and I'll send you a photocopy.
∂20-Feb-90 1617 chandler@Sunburn.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 16:17:16 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22710; Tue, 20 Feb 90 16:17:25 -0800
Date: Tue, 20 Feb 1990 16:17:24 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Publication
Message-Id: <CMM.0.88.635559444.chandler@Sunburn.Stanford.EDU>
I've just received a publication from NSF entitled "NSF CISE Newsletter"
dated February 1990. I'll be glad to send you a copy if you're interested in
seeing it. Just let me know.
∂20-Feb-90 1818 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 18:18:39 PST
Received: from CIS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27812; Tue, 20 Feb 90 18:17:33 -0800
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA13083; Tue, 20 Feb 90 18:16:07 PST
Date: Tue, 20 Feb 90 18:16:07 PST
From: marty@cis.Stanford.EDU (Marty Tenenbaum)
Message-Id: <9002210216.AA13083@cis.Stanford.EDU>
To: chandler@sunburn.stanford.edu
Cc: faculty@cs.stanford.edu
In-Reply-To: "Joyce R. Chandler"'s message of Tue, 20 Feb 1990 16:16:00 GMT <CMM.0.88.635559360.chandler@Sunburn.Stanford.EDU>
Subject: Publication
please copy me.
∂20-Feb-90 1818 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Feb 90 18:18:29 PST
Received: from CIS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27802; Tue, 20 Feb 90 18:17:12 -0800
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA13080; Tue, 20 Feb 90 18:15:54 PST
Date: Tue, 20 Feb 90 18:15:54 PST
From: marty@cis.Stanford.EDU (Marty Tenenbaum)
Message-Id: <9002210215.AA13080@cis.Stanford.EDU>
To: chandler@sunburn.stanford.edu
Cc: faculty@cs.stanford.edu
In-Reply-To: "Joyce R. Chandler"'s message of Tue, 20 Feb 1990 16:17:24 GMT <CMM.0.88.635559444.chandler@Sunburn.Stanford.EDU>
Subject: Publication
please send a copy. Thanks, JMT.
∂21-Feb-90 0836 hemenway@Sunburn.Stanford.EDU Round 2 Schedule
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Feb 90 08:36:03 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA03126; Wed, 21 Feb 90 08:36:23 -0800
Date: Wed, 21 Feb 1990 8:36:22 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Round 2 Schedule
Message-Id: <CMM.0.88.635618182.hemenway@Sunburn.Stanford.EDU>
Here is the schedule agreed to for the Round 2 readings. The entries
in the table are rater numbers.
Pickup Day Batch 1 Batch 2 Batch 3 Batch 4
__________________________________________________
Wed., 2/21 4 11 7 13 2=M. Derr
Thurs., 2/22 5 12 8 2 3=D. Dill
Fri., 2/23 6 13 9 4 4=R. Gabriel
Sat., 2/24 7 2 11 3 5=A. Goldberg
Sun., 2/25 8 3 12 9 6=O. Khatib
Mon., 2/26 9 8 13 6 7=J. Koza
Tues., 2/27 11 5 2 7 8=J. McCarthy
Wed., 2/28 12 6 3 8 9=J. Mitchell
Thurs., 3/1 13 7 4 5 11=S. Nowick
Fri., 3/2 2 9 5 11 12=V. Pratt
Sat., 3/3 3 4 6 12 13=K. Ross
We will aim to have the batches for today's readers (Dick, Steve, John
and Ken) ready by 3:00. There are 83 applicants in Round 2 so there
will be 3 batches of 21 folders and one of 20.
The final meeting will be at 2:30 pm on Sunday, March 4 in MJH 252.
Are we correct in thinking that Andy Goldberg and John Mitchell are
the only two who might not be able to make it at that time?
Some groundrules for Round 2:
(1) It is your responsibility to arrange with the readers on either
side of you for pick-up and drop-off of the batches. Feel free to use
my office (or the box outside of it) as a drop-off point.
(2) We will put 11 blank rating sheets in each folder today. As you
read and rate them, remove your rating sheet; it should not be passed
onto the next reader. I would much prefer it if you could give me
your rating sheets as you complete each batch. If you really, really
want to hold onto them until you have read all the folders, please be
sure to get them back to me before Saturday, March 3.
(3) The schedule is tight enough that even if you have not had a
chance to read all of the folders (or any), you still must pass them
onto the next reader. You might be able to arrange a "time-share"
with a reader further down the line.
One last thing--while it is certainly fine that some of you took your
Round 1 rating sheets with you, please do be sure to get them back to
me at the end.
Have fun (seriously!) and please do let me know if any problems arise.
Sharon
∂21-Feb-90 0845 bergman@Sunburn.Stanford.EDU funding announcement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Feb 90 08:45:31 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA03496; Wed, 21 Feb 90 08:45:27 -0800
Date: Wed, 21 Feb 1990 8:45:27 GMT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: funding announcement
Message-Id: <CMM.0.88.635618727.bergman@Sunburn.Stanford.EDU>
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
NASA RFP: "Scientific, Engineering Operations and Related Computer
Software Design and Development"
Provide scientific and engineering operations support as well as
related computer software design and development support in the area
of solar physics, space plasma physics, astrophysics, astronomy and
other space related fields. Deadline: March 30, 1990.
∂21-Feb-90 1152 helen@russell.Stanford.EDU Courses and Degrees
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Feb 90 11:52:36 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA01497; Wed, 21 Feb 90 11:54:03 PST
Date: Wed 21 Feb 90 11:54:02-PST
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: Courses and Degrees
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <635630042.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
TO: SSP FACULTY
SUBJECT: COURSES AND DEGREES 1990-91
We're beginning to work on the revised SSP entry for next year's Courses and
Degrees Bulletin. We do most of our routine checking directly with our
affiliated departments but from you, we'd appreciate the following information:
1. Work status change: For example, are you planning a sabbatical leave,
coming back from one, leaving the area, etc.
2. Are you teaching a course or seminar that fits the content area of SSP?
This includes courses and seminars not already listed in the SSP curriculum.
If you dont yet have plans to teach or conduct a seminar, but are interested
in exploring the possibility, we'd be delighted to discuss this further with
you. Contact Helen or Jim (helen@csli, or Greeno@csli, respectively.)
3. Nomination of new SSP faculty. We're eager for suggestions of members of
the Stanford community ("regular" or consulting faculty) who would be suitable
additions to the SSP faculty.
Thanks,
Helen
p.s. We'd appreciate your replies, if possible, before the end of Feb.
-------
∂21-Feb-90 1251 @RELAY.CS.NET:mazzetti@ed.aaai.org Prize award issue
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 21 Feb 90 12:51:11 PST
Received: from relay2.cs.net by RELAY.CS.NET id ad14437; 21 Feb 90 14:40 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa04259; 21 Feb 90 15:38 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA00883; Wed, 21 Feb 90 09:57:55 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA00651; Wed, 21 Feb 90 10:04:15 PST
Date: Wed, 21 Feb 90 10:04:15 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9002211804.AA00651@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@score.stanford.edu, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@score.stanford.edu, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Subject: Prize award issue
Cc: mazzetti@nilsson, taglio@nilsson, tgd@CS.ORST.EDU
I've received 5 messages responding to the issue of the continuation of
the prize paper award during NCAI. Out of the five, 4 were pretty negative.
Since the program chairs are about to start the reviewing process tomorrow
(that is, shipping the papers), I can only assume from the responses that
there should be a discontinuation of the award starting in 1990.
If anyone wants to plead a counter case, please respond by Monday, Feb 26,
at the very latest.
Claudia
∂21-Feb-90 1412 LOGMTC-mailer seminar
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
PROGRAM SYNTHESIS IN LARGE
Enn Tyugu
Estonian Academy of Sciences
Tallinn, USSR
Friday, February 23, 3:15pm
MJH 252
Some years ago a program synthesizer was implemented
in which data flow schemas with higher order objects were used
as program specifications. It turned out that a class of
higher order data flow schemas was equivalent to a fragment of
intuitionistic propositional logic. Further on, several other
classes of constructive propositional theories appeared to be
useful for automatic program synthesis due the existence of
fast proof searching algorithms for them. Recently a fine
classification of such theories together with derivation
complexity estimation was given by M.Kanovich.
In this talk, logic and architecture of several
programming environments with automatic program synthesis
based on propositional logic is considered. Application
examples, including CAD, data logic and compiler construction
are discussed.
∂21-Feb-90 1535 ingrid@russell.Stanford.EDU CSLI Calendar, 22 February, vol. 5:18
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Feb 90 15:35:32 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA03670; Wed, 21 Feb 90 14:51:31 PST
Date: Wed, 21 Feb 90 14:51:31 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9002212251.AA03670@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 22 February, vol. 5:18
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
22 February 1990 Stanford Vol. 5, No. 18
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 1 MARCH 1990
12:00 noon TINLunch
Cordura 100 Reading: Underspecification in Phonetics
by Patricia Keating
Discussion led by Bill Poser
(poser@csli.stanford.edu)
Abstract below
____________
ANNOUNCEMENT
There will be no TINLunch, CSLI Seminar, or CSLI Colloquium this
Thursday, 22 February.
____________
NEXT WEEK'S TINLUNCH
Reading: Underspecification in Phonetics
by Patricia Keating
(_Phonology_ 5 (1988): 275-92)
Discussion led by Bill Poser
Over the past twenty years, there has been an evolution in thinking
about the extent to which information in phonological representations
is specified and at what levels of representation, from classical
generative phonology, in which every feature was fully specified at
every level of representation, through various versions of
autosegmental phonology, in which underlying representations need not
be fully specified, to recent work, which suggests that the input to
the phonetic rules need not be fully specified. I will discuss
Keating's paper as an overview of
these issues.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
Using Autoepistemic Expansions for Diagnosis
Kave Eshghi
Hewlett-Packard Laboratories, Bristol, England
Thursday, 22 February, 3:15 p.m.
Margaret Jacks Hall 352
An extension of the DeKleer and Reiter's theory of diagnosis is
discussed that allows nonmonotonic constructs in the system
description. This extension uses the negation as failure rule of
logic programming. The diagnoses generated correspond to stable
expansion of the corresponding autoepistemic theories.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
David Israel
(israel@csli.stanford.edu)
Thursday, 22 February, 3:45 p.m.
Cordura 100
____________
David Israel will present materials on proof theory and meaning,
inspired by chapter III.8 of the _Handbook of Philosophical Logic_.
____________
SYMBOLIC SYSTEMS FORUM
Intention, Commitment, and Communication
Phil Cohen
SRI International and Department of Linguistics
(pcohen@ai.sri.com)
Thursday, 22 February, 4:15 p.m.
Building 60, Room 61G
It is often said that language is a special case of human action;
theories of individual action should have something interesting to say
about how language is used. This talk will sketch an analysis of
intention and action, will apply that analysis to something as simple
as a request, and then show why it fails to capture some common
properties of dialogue. I will conclude with a brief theory of joint
(i.e., collective or collaborative) activity, and show why it is a
better basis for describing dialogue than speech act theory.
Next, 1 March, Pat Hayes, Xerox PARC and Department of Computer
Science, will talk. Title: Time Points or Time Intervals? Problems in
Axiomatizing Common Sense.
____________
PHILOSOPHY DEPARTMENT AND ETHICS IN SOCIETY COLLOQUIUM
Inequalities of Income and Wealth
Joseph Stiglitz
Department of Economics
Friday, 23 February, 3:15 p.m.
Building 90, Room 92A
No abstract available.
____________
COMPUTER SCIENCE DEPARTMENT COLLOQUIUM
Program Synthesis in Large
Enn Tyugu
Estonian Academy of Sciences, Tallinn, USSR
Friday, 23 February, 3:15 p.m.
Margaret Jacks Hall 252
Some years ago, a program synthesizer was implemented in which
data-flow schemas with higher-order objects were used as program
specifications. It turned out that a class of higher-order data-flow
schemas was equivalent to a fragment of intuitionistic propositional
logic. Furthermore, several other classes of constructive
propositional theories appeared to be useful for automatic program
synthesis due the existence of fast proof-searching algorithms for
them. Recently, a fine classification of such theories, together with
derivation complexity estimation, was given by M. Kanovich.
In this talk, logic and architecture of several programming
environments with automatic program synthesis based on propositional
logic is considered. Application examples, including CAD, data logic,
and compiler construction are discussed.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Nominal Comparatives and Generalized Quantifiers
John Nerbonne
Hewlett-Packard Laboratories
(nerbonne@hplabs.hp.com)
Friday, 23 February, 3:30 p.m.
Cordura 100
There's an extensive literature on the semantics of _adjectival_
comparison, but much less on _nominal_ comparatives (i.e., of the sort
illustrated below). Keenan and Stavi investigate these fairly
abstractly from a generalized-quantifier perspective, demonstrating,
e.g., conservativity (and adducing an interesting class of ternary
determiners). But their approach is broad and systematic; comparative
determiners are syncategorematic.
In the work presented here, we likewise adopt the GQ perspective, but
focus on microstructure of comparative determiners. We begin with a
domain of discourse upon which a lattice structure (Link's) is
imposed, and which maps, first to a domain of abstract dimensions
(cardinalities, volumes), and then to concrete measures (in N,R+).
The mapping must be Archimedean. Comparisons begin as simple
predicates on dimensions or measures; from these we derive relations
(classes) of predicates on the domain, i.e., generalized determiners
(quantifiers), and show, e.g., how monotonicity properties follow in
the derivation. This results in a proposal for a logical language,
which includes _derived_ determiners, and which is an attractive
target for semantics interpretation.
More (fewer) than seven children sang.
How many children sang?
A trained seven more (fewer) children than B saw (dogs).
A trained twice as many (few) children as B saw (dogs).
A trained at least twice as many (fewer) children as B saw (dogs).
More (less) than two liters of water spilled.
How much water spilled?
How many liters of water spilled?
A spilled two liters more (less) beer than B drank (water).
A spilled twice as much (little?) beer as B drank (water).
A spilled at least twice as much (little?) beer as B drank (water).
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
General Patterns of Nonmonotonic Reasoning
Daniel Lehmann
Hebrew University
Monday, 26 February, 2:30 p.m.
Margaret Jacks Hall 252
Recent developments in the area of nonmonotonic reasoning have
converged onto a number of specific properties of nonmonotonic
inference operations. Nonmonotonic inference operations appear as a
natural generalization of Tarski's consequence operations. The need
and justification for considering such a generalization will be
discussed and some of the recent results reviewed.
____________
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Participatory Design and User Programming
Jeff Johnson and Bonnie Nardi
Human-Computer Interaction Department
Hewlett-Packard Laboratories
Wednesday, 28 February, 12:15 p.m.
Ventura 17
Participatory Design is a new approach to designing computer systems
that places great emphasis on getting the eventual users of a system
involved in its design. It goes beyond the traditional design wisdom
of constructing prototypes and conducting user-tests, i.e., "test
early and often." Instead of being regarded as mere information
sources for designers, users are considered their _peers_, as experts
in the task domain, the expertise that matters most, rather than in
the technology. Participatory Design embodies methodologies that
allow technical experts to work together with task-domain experts to
produce designs. Without Participatory Design, systems result that
are satisfactory neither to users, who must use the system every day,
nor to their employers, who are presumably adding computer systems to
realize productivity gains.
Participatory Design has been more successful in Europe, particularly
in Scandinavia, than it has been in the United States, where the
techniques are less well known. It has also been applied, thus far,
more to the design of custom systems for particular work sites than to
the design of "off-the-shelf" applications and computer-based
appliances sold by vendors.
To promote greater understanding of Participatory Design in the U.S.
and to explore its applicability to the design of "off-the-shelf"
applications, Computer Professionals for Social Responsibility (CPSR)
is sponsoring a conference, PDC '90. CPSR is also sponsoring a panel
on Participatory Design at the upcoming ACM SIGCHI '90 conference,
which immediately follows PDC '90 in Seattle. Jeff Johnson is a
cochair of PDC '90 and the organizer of the panel. Bonnie Nardi is
one of the panelists.
Jeff will introduce Participatory Design and the notions of
"task-specific applications" and "end-user programming," and Bonnie
will discuss end-user programming as a possible approach to
Participatory Design.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Self-Affirmation: Applications to Social
Theory and Minority Achievement
Claude Steele
University of Michigan
Wednesday, 28 February, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
SITUATION SEMANTICS SEMINAR
Questions
Jonathan Ginzburg
(ginzburg@csli.stanford.edu)
Wednesday, 28 February, 4:00 p.m.
Cordura 100
This will be the start of a series of meetings in which we discuss a
new topic: Questions. In the first meeting, I will present a review
of some previous approaches to questions, within other semantic
frameworks.
____________
ANNUAL MEETING OF THE WEST COAST CONFERENCE
ON FORMAL LINGUISTICS
Stanford University
Friday, 2 March - Sunday, 4 March
The 9th Annual Meeting of the West Coast Conference on Formal
Linguistics (WCCFL) will be held at Stanford University, hosted by the
Department of Linguistics, and coordinated by Peter Sells.
WCCFL was founded at Stanford in 1982. This year, forty-two papers on
all aspects of formal linguistics will be presented. There will be
speakers from all over the U.S., Canada, and Western Europe, as well
as five speakers from the Stanford community. Meetings will be held
at CSLI during Friday, 2 March, and in Jordan Hall during Saturday and
Sunday, 3 and 4 March.
The schedule for the conference is readable online in
/user/wccfl/schedule; for registration information, and so on, please
send mail to wccfl@csli.stanford.edu (registration fees for the
Stanford community are $10 for students and $15 for nonstudents).
____________
∂21-Feb-90 1710 fisher@Sunburn.Stanford.EDU old computers
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Feb 90 17:10:14 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA23336; Wed, 21 Feb 90 17:09:54 -0800
Date: Wed, 21 Feb 1990 17:09:53 GMT
From: Steve Fisher <fisher@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: old computers
Message-Id: <CMM.0.88.635648993.fisher@Sunburn.Stanford.EDU>
This Monday I'm giving a lecture in CS105A on the history of computing.
I was wondering if any of you know of any good stories that reveal
what computing was like "in the old days," or if you have any information
about particularly important events that should definitely be covered,
or if any of you have any photographs, specs, or working models of
old computers. One aspect of our history I'm sure to stress is the
tremendous speed at which hardware has developed, and pictures,
specs, and working computers can really help make this clear.
Thanks for any help,
Steve
∂21-Feb-90 1746 marty@cis.Stanford.EDU Prize award issue
Received: from cis.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Feb 90 17:46:36 PST
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA26784; Wed, 21 Feb 90 17:40:48 PST
Date: Wed, 21 Feb 90 17:40:48 PST
From: marty@cis.stanford.edu (Marty Tenenbaum)
Message-Id: <9002220140.AA26784@cis.Stanford.EDU>
To: mazzetti%ed.aaai.org@relay.cs.net
Cc: Feigenbaum@sumex-aim.stanford.edu, Hayes-Roth@sumex-aim.stanford.edu,
Hinton@ri.cmu.edu, JMC-LIsts@sail.stanford.edu,
Lehnert%cs.umass.edu@relay.cs.net,
Nilsson%score.stanford.edu@relay.cs.net, RGSmith@slcs.slb.com,
Rich@mcc.com, bobrow@xerox.com, buchanan@vax.cs.pitt.edu,
clancey.pa@xerox.com, duda%polya%score.stanford.edu@relay.cs.net,
engelmore@sumex-aim.stanford.edu, forbus@a.cs.uiuc.edu,
hart@kl.sri.com, hector%ai.toronto.edu@relay.cs.net,
hes%scrc-vallecito.symbolics.com@relay.cs.net,
marty%cis.stanford.edu@relay.cs.net, mckeown@cs.columbia.edu,
minsky%mc.lcs.mit.edu@relay.cs.net, reddy@fas.ri.cmu.edu,
swartout@vaxa.isi.edu, mazzetti@nilsson, taglio@nilsson,
tgd@cs.orst.edu
In-Reply-To: Claudia Mazzetti's message of Wed, 21 Feb 90 10:04:15 PST <9002211804.AA00651@nilsson.aaai.org>
Subject: Prize award issue
Claudia,
I would like to concur with Reid Smiths view: 1 award for a truly outstanding
paper, offered occasionally, only as warranted.
∂22-Feb-90 1020 LOGMTC-mailer Mints seminar series
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker: Grigori Mints, Institute of Cybernetics, Tallinn 200108, Estonia
Title: Resolution Calculi for Propositional Modal Logics
Time: Noon, Wednesday February 28, 1990
Place: 352 Margaret Jacks Hall (Stanford Computer Science)
Abstract:
This is a sequel to the previous presentation, where complete
resolution-type calculi were constructed for several propositional
modal logics, including S5, S4, T and K. Here we extend this to the
predicate logic, using the same method, which provides a general
scheme for transforming a cutfree Gentzen-type system into a
resolution-type system. To make the presentation self-contained,
we will recapitulate some material.
∂22-Feb-90 1308 turner@sierra.Stanford.EDU Time Schedules Spring 89-90
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Feb 90 13:08:46 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Thu, 22 Feb 90 13:03:11 PST
Date: Thu, 22 Feb 90 13:03:11 PST
From: turner@sierra.Stanford.EDU (Sherry A. Turner)
To: ee-adminlist@sierra.Stanford.EDU
Cc: ee-faculty@sierra.Stanford.EDU
Subject: Time Schedules Spring 89-90
Message-Id: <CMM.0.88.635720590.turner@>
The Time Schedule for Spring Quarter 1989-90 is available for you to pick up
in McCullough 150. Remember to pick up the sheet which have the changes to
the Time Schedule (yellow sheet).
Thanks!
-Sherry-
∂22-Feb-90 1912 @RELAY.CS.NET:mazzetti@ed.aaai.org
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 22 Feb 90 19:12:05 PST
Received: from relay2.cs.net by RELAY.CS.NET id ac20999; 22 Feb 90 21:11 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa26481; 22 Feb 90 22:08 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA02128; Thu, 22 Feb 90 16:27:38 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA01609; Thu, 22 Feb 90 16:34:06 PST
Date: Thu, 22 Feb 90 16:34:06 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9002230034.AA01609@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@score.stanford.edu, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@score.stanford.edu, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Cc: mazzetti@nilsson, tgd@CS.ORST.EDU
MMDF-Warning: Unable to confirm address in preceding line at RELAY.CS.NET
prize paper award
Based on the several recent responses,the recommendation which suggests only
recognizing the one and only, outstanding paper, as warranted, may be a
viable solution. Let's not forget that this issue only became an issue
because of the extensive dissatisfaction associated with the way we have
given out prizes in the past. It is not that we haven't tried to adjust the
process over the years. We have tried several different approaches and found
them ALL wanting. This issue is not something coming out of the blue. It is
a genuine sentiment amoung many people who have experienced this process
on past program committees.
Bill and Tom have suggested that we suspend the prize this year and pursue
the implementation procedures for identifying that very outstanding paper
for 1991. If that plan is unacceptable to you, let me know so that we can
pursue another path.
Cheers, Claudia
∂22-Feb-90 2022 LOGMTC-mailer seminar
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Feb 90 20:22:19 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA00491; Thu, 22 Feb 90 20:22:51 -0800
Date: 21 Feb 90 22:12:00 GMT
From: CLT@SAIL.STANFORD.EDU (Carolyn Talcott)
Organization: Stanford University
Subject: seminar
Message-Id: <omxOE@SAIL.Stanford.EDU>
Sender: logmtc-mailer@sail.stanford.edu
To: logmtc@sail.stanford.edu
PROGRAM SYNTHESIS IN LARGE
Enn Tyugu
Estonian Academy of Sciences
Tallinn, USSR
Friday, February 23, 3:15pm
MJH 252
Some years ago a program synthesizer was implemented
in which data flow schemas with higher order objects were used
as program specifications. It turned out that a class of
higher order data flow schemas was equivalent to a fragment of
intuitionistic propositional logic. Further on, several other
classes of constructive propositional theories appeared to be
useful for automatic program synthesis due the existence of
fast proof searching algorithms for them. Recently a fine
classification of such theories together with derivation
complexity estimation was given by M.Kanovich.
In this talk, logic and architecture of several
programming environments with automatic program synthesis
based on propositional logic is considered. Application
examples, including CAD, data logic and compiler construction
are discussed.
∂22-Feb-90 2111 LOGMTC-mailer Mints seminar series
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Feb 90 21:11:28 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA03757; Thu, 22 Feb 90 21:12:00 -0800
Date: 22 Feb 90 18:20:00 GMT
From: CLT@SAIL.STANFORD.EDU (Carolyn Talcott)
Organization: Stanford University
Subject: Mints seminar series
Message-Id: <7n95B@SAIL.Stanford.EDU>
Sender: logmtc-mailer@sail.stanford.edu
To: logmtc@sail.stanford.edu
Speaker: Grigori Mints, Institute of Cybernetics, Tallinn 200108, Estonia
Title: Resolution Calculi for Propositional Modal Logics
Time: Noon, Wednesday February 28, 1990
Place: 352 Margaret Jacks Hall (Stanford Computer Science)
Abstract:
This is a sequel to the previous presentation, where complete
resolution-type calculi were constructed for several propositional
modal logics, including S5, S4, T and K. Here we extend this to the
predicate logic, using the same method, which provides a general
scheme for transforming a cutfree Gentzen-type system into a
resolution-type system. To make the presentation self-contained,
we will recapitulate some material.
∂22-Feb-90 2129 marty@cis.Stanford.EDU
Received: from cis.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Feb 90 21:29:14 PST
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA06951; Thu, 22 Feb 90 21:26:31 PST
Date: Thu, 22 Feb 90 21:26:31 PST
From: marty@cis.stanford.edu (Marty Tenenbaum)
Message-Id: <9002230526.AA06951@cis.Stanford.EDU>
To: mazzetti%ed.aaai.org@relay.cs.net
Cc: Feigenbaum@sumex-aim.stanford.edu, Hayes-Roth@sumex-aim.stanford.edu,
Hinton@ri.cmu.edu, JMC-LIsts@sail.stanford.edu,
Lehnert%cs.umass.edu@relay.cs.net,
Nilsson%score.stanford.edu@relay.cs.net, RGSmith@slcs.slb.com,
Rich@mcc.com, bobrow@xerox.com, buchanan@vax.cs.pitt.edu,
clancey.pa@xerox.com, duda%polya%score.stanford.edu@relay.cs.net,
engelmore@sumex-aim.stanford.edu, forbus@a.cs.uiuc.edu,
hart@kl.sri.com, hector%ai.toronto.edu@relay.cs.net,
hes%scrc-vallecito.symbolics.com@relay.cs.net,
marty%cis.stanford.edu@relay.cs.net, mckeown@cs.columbia.edu,
minsky%mc.lcs.mit.edu@relay.cs.net, reddy@fas.ri.cmu.edu,
swartout@vaxa.isi.edu, mazzetti@nilsson, tgd@cs.orst.edu
In-Reply-To: Claudia Mazzetti's message of Thu, 22 Feb 90 16:34:06 PST <9002230034.AA01609@nilsson.aaai.org>
We should see if we have a clearly outstanding paper, and then decide!
JMT.
∂22-Feb-90 2147 forbus@cs.uiuc.edu Foo on awards
Received: from p.cs.uiuc.edu by SAIL.Stanford.EDU with TCP; 22 Feb 90 21:46:50 PST
Received: by p.cs.uiuc.edu
(5.61+/IDA-1.2.8) id AA02700; Thu, 22 Feb 90 23:41:26 -0600
Date: Thu, 22 Feb 90 23:41:26 -0600
From: Kenneth Forbus <forbus@cs.uiuc.edu>
Message-Id: <9002230541.AA02700@p.cs.uiuc.edu>
To: marty@cis.stanford.edu
Cc: mazzetti@ed.aaai.org, Feigenbaum@sumex-aim.stanford.edu,
Hayes-Roth@sumex-aim.stanford.edu, Hinton@ri.cmu.edu,
JMC-LIsts@sail.stanford.edu, Lehnert@cs.umass.edu,
Nilsson@score.stanford.edu, RGSmith@slcs.slb.com, Rich@mcc.com,
bobrow@xerox.com, buchanan@vax.cs.pitt.edu, clancey.pa@xerox.com,
duda%polya@score.stanford.edu, engelmore@sumex-aim.stanford.edu,
hart@kl.sri.com, hector@ai.toronto.edu,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@cs.columbia.edu, minsky@mc.lcs.mit.edu, reddy@fas.ri.cmu.edu,
swartout@vaxa.isi.edu, nilsson!mazzetti, tgd@cs.orst.edu
In-Reply-To: Marty Tenenbaum's message of Thu, 22 Feb 90 21:26:31 PST <9002230526.AA06951@cis.Stanford.EDU>
Subject: Foo on awards
From: marty@cis.stanford.edu (Marty Tenenbaum)
We should see if we have a clearly outstanding paper, and then decide!
I heartily disagree. Given the lack of concensus in the process, it
is ridiculous to claim there is one "best" paper. All it does is
degrade the rest. People should think of getting a paper in the
conference as honor enough.
I think we should flush the paper prizes now, and be done with it.
∂23-Feb-90 0502 rgsmith@SLCS.SLB.COM prize paper award
Received: from SLCS.SLB.COM by SAIL.Stanford.EDU with TCP; 23 Feb 90 05:02:32 PST
Received: from topcat.SLCS.SLB.COM
by SLCS.SLB.COM (4.1/SLCS Mailhost 2.3)
id AA04344; Fri, 23 Feb 90 07:03:25 CST
Received: by topcat.SLCS.SLB.COM (4.1/SLCS Subsidiary 1.5)
id AA09879; Fri, 23 Feb 90 07:03:22 CST
Date: Fri, 23 Feb 90 07:03:22 CST
From: rgsmith@SLCS.SLB.COM
Message-Id: <9002231303.AA09879.rgsmith@topcat.SLCS.SLB.COM>
To: mazzetti%ed.aaai.org@RELAY.CS.NET
Cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU,
Lehnert%cs.umass.edu@RELAY.CS.NET,
Nilsson%score.stanford.edu@RELAY.CS.NET, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya%score.stanford.edu@RELAY.CS.NET,
engelmore@SUMEX-AIM.STANFORD.EDU, forbus@A.CS.UIUC.EDU,
hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes%scrc-vallecito.symbolics.com@RELAY.CS.NET,
marty%cis.stanford.edu@RELAY.CS.NET, mckeown@CS.COLUMBIA.EDU,
minsky%mc.lcs.mit.edu@RELAY.CS.NET, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU, mazzetti@nilsson, tgd@CS.ORST.EDU
In-Reply-To: <9002230034.AA01609@nilsson.aaai.org> "mazzetti%ed.aaai.org@RELAY.CS.NET"
Subject: prize paper award
I concur with Marty. Let's look before we decide.
-Reid
∂23-Feb-90 0823 LOGMTC-mailer tuesday seminar
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Tuesday February 27
mjh 301
4:15 pm
The Abstraction and Instantiation of String Matching Programs
Olivier Danvy
Visiting Stanford Computer Science Department
from University of Copenhagen
Partial evaluation is a program transformation technique based on
Kleene's S↑m_n-theorem. This talk addresses partially evaluating a
string matching program that checks whether a pattern occurs within a
text. The partial evaluation rules are kept extremely simple. The
string matching program is the naive one: the pattern matches the text
if and only if it is a prefix of one of the suffixes.
Yet specializing the matching program with respect to the pattern
produces either the Knuth-Morris-Pratt or the Boyer-Moore string
matching algorithm, depending on whether the pattern is accessed from
left to right or from right to left. Furthermore specializing the
matching program with respect to the text produces compiled Weiner
trees (ie, Aho-Hopcroft-Ullman's position trees). However more work
is required to obtain compacted trees.
These derivations are important because they expresses that somehow
the cleverness in the linear algorithms was already present in the
naive one. Disclaimer: we have not obtained the *linear* generation
of the failure table, which was the other major point in the
Knuth-Morris-Pratt. This is because partial evaluation cannot be
expected to be linear in the arguments of a source program.
Partial evaluation offers a relatively uniform way to derive clever
algorithms with a uniform and reusable eureka step. This should be
useful because independent discoveries abound that are merely an
application of the S↑m_n theorem and of our generic eureka step.
As a conclusion of the talk we address what is desirable from a
partial evaluator (including self-application), how it can be
achieved, and at which price. More general program transformations
such as Andrei Ershov's Mixed Computation and Valentin Turchin's
Supercompilation are also addressed.
The work is joint with Charles Consel and Karoline Malmkjaer.
∂23-Feb-90 1053 turner@sierra.Stanford.EDU Spring Qtr Exam Change
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Feb 90 10:53:43 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Fri, 23 Feb 90 10:49:44 PST
Date: Fri, 23 Feb 90 10:49:44 PST
From: turner@sierra.Stanford.EDU (Sherry A. Turner)
To: ee-faculty@sierra
Cc: ee-adminlist@sierra.Stanford.EDU
Subject: Spring Qtr Exam Change
Message-Id: <CMM.0.88.635798982.turner@>
STUDENTS, FACULTY, AND ADMINISTRATORS, PLEASE NOTE:
The days listed for the Tuesday, June 12, 12:15-3:15 p.m. slot in the Spring
End-Quarter Examination Schedule in the Spring Time Schedule are incorrect.
The correct times and days are:
*Classes meeting 8 a.m., 3:15 p.m., 4:15 p.m. ONLY on Tues., Thurs., (Sat.)
∂23-Feb-90 1112 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parcella '90 call for papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Feb 90 11:12:37 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04909; Fri, 23 Feb 90 11:12:33 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13177; Fri, 23 Feb 90 11:12:51 -0800
Message-Id: <9002231912.AA13177@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2567; Fri, 23 Feb 90 12:38:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2537; Fri, 23 Feb 90 12:38:36 CST
Date: Fri, 23 Feb 90 12:36:29 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Frank Dehne <dehne@cs.purdue.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Frank Dehne <dehne%cs.purdue.edu@VM1.NoDak.EDU>
Subject: parcella '90 call for papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
PARCELLA 90
Call for Papers
Fifth International Workshop on Parallel Processing by Cellular Automata and
Arrays
Berlin, G.D.R
September 17 - 21, 1990
Central Institute for Cybernetics and Information Processes
Academy of Sciences of the G.D.R, National IFIP Council of the G.D.R
in Cooperation with Hungarian Academy of Sciences, Cellware Ltd (Budapest)
The Parcella Workshop series is the first and, until now, the only series in the
field of Parallel Processing in the socialist countries of central and Eastern
Europe and the first one on Massive Parallelism in Europe. As in the foregoing
meetings Parcella 90 will present the landscape of research in these countries
and will be a meeting place with scientists from West Europe as well as
overseas. The organizers consider Berlin to be an excellent place for
initializing an international exchange of ideas and for cooperation.
TOPICS OF INTEREST:
Massive and Cellular finegrained Parallelism
Parallelism tending to massive
Selected Topics on Froitiers in Massive Parallel Computing
The following key words illustrate the wide range of interests:
Mathematical Foundations, Taxonomy of Architectures, Concepts of Systems
Languages, Programming, Theory of Algorithms, Data Flow, Design of Compilers,
Systolization, Design of Architectures and Systems, Memory and Memory Access,
Interconnection Networks, Routing Implementation, Performance Evaluation,
Simulation, Verification Numerical Application, Image Processing and
Modelling, Computational Geometry, Computer Graphics, AI and non-numerical
Applications, Graphalgorithms, Fault-tolerant Computing, Supercomputing,
Cellware, Neurocomputing and Connectionism, Optical Computing, etc.
CHAIRMEN-BOARD:
G. Wolf (Berlin), T. Legendi (Budapest), U. Schendel (Berlin-West)
SCIENTIFIC ADVISER: V. Kempe (Berlin)
MEMBERS OF THE INTERNATIONAL PROGRAMME COMMITTEE:
(non-final list)
H. Alt (Berlin-West), B. Buchberger (Linz), H. Burkhart (Zurich), R. Creutzburg
(Karlsruhe),P.-E. Danielson (Linkoeping) , F. Dehne (Ottawa), D. J. Evans
(Loughborough), V. Gritzyk (Lvov), W. Haendler (Erlangen), C. R. Jesshope
(Southampton), Ph. Jorrand (Grenoble), A. Jugel (Dresden), D. Jungmann
(Dresden), E. Katona (Szeged), H. T. Kung (Pittsburgh), St. Levialdi (Rome), D.
G. Maritsas (Patras), V. A. Melnikov (Moscow), L. Richter (Z∨rich), A.
Rosenfeld (Maryland), J.-R. Sack (Ottawa), J. Toth (Budapest), R. Vollmar
(Karlsruhe)
W. Wilhelmi (Berlin) acts as the head of the scientific programme
INVITED SPEAKERS:Presentations on different aspects of research within the field
of interest by members of the International Programme Committee and special
invited speakers.
SUBMITTED PAPERS:
5 copies of the full paper (max 6 pages) should be sent to the local chairman
not later than
March 31, 1990
via the conference office.
TYPE OF PRESENTATION:
Authors should make evident the potential or real gain of their results.
ADDITIONAL EVENTS:
An exhibition will be organized for prototypes and products in the field of
parallel machines. A poster session will be organized. Computer demonstrations
can be performed on the available machines (PC/XT, PC/AT and compatibles).
Round tables discussion: In case of any suggestions concerning these events
please contact the local or any other of the chairmen. Cultural and social
events are under preparation.
AWARDS:The IPC will award a prize for the best contribution of a young scientist
under 30.
PUBLICATION: It is intended to publish the proceedings by Eastern and Western
publishing houses. Author instructions available from the organizers.
REGISTRATION:
Please register not later than March 31, 1990. (Form available from the
organizers.) Please note that accomodation ordering and registration should be
combined.
CONFERENCE OFFICE:
Mrs. S Boettcher, (Head of the office), Phone: (Berlin) 2 03 72 264
Mailing address at the end of this announcement
PLACE:
Berlin, G.D.R., Haus der Ungarischen Kultur, Karl-Liebknecht-Strasse 9, Berlin,
1020
TIME: From Monday, September 17th to Friday, September 21st 1990.
Monday and Friday are half-conference days, i.e. the programme starts on Monday
afternoon and ends on Friday morning
LANGUAGE: Conference language is English
CONFERENCE FEE (including proceedings):
for non-speakers 450,- M/DM till 30.7.90; 600,- M/DM after
for speakers 300,- M/DM till 30.7.90; 400,- M/DM after
The fee should be transferred to
Dt. Aussenhandelsbank AG der DDR, Berlin
Account-No. 6836-20-20792
Coding 820 5525
Add your name please
Participants from Western countries have to pay in their own currencies
LIST OF DEADLINES:
Submission of papers and registration form
March 31
Acceptance/Rejection of papers
May 31
Final Programme
June 30
VISA:
Visa for prospective participants of Western countries will be organized by the
conference office. Please contact the organzers for an entry permission form.
Note please that the organizers need this form not later than 10 weeks before,
i.e. not later thanJune 30, 1990.
ACCOMMODATION: Accommodation can be organized on request
Prices for participants from socialist countries:
1 bedroom
130,- M
2 bedrooms
200,- M
Prices for participants from non-socialist countries:
1 bedroom
130,- DM
2 bedrooms
200,- DM
Send your ordering together with your registration form.
MAILING ADDRESS (also of conference office):
Zentralinstitut f∨r Kybernetik und Informationsprozesse
Kurstrasse 33
P.O.B. 1298
Berlin 1086 G.D.R.
Telex: 114536 zki dd
Fax: (Berlin) 2037 2301
Dr. G. Wolf (local chairman)
Phone: (Berlin) 20 37 23 13 direct.; 291 Secretary.
∂23-Feb-90 1121 reis@cis.Stanford.EDU An Unusual High Noon Talk
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Feb 90 11:21:27 PST
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Fri, 23 Feb 90 11:17:52 PST
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA17379; Fri, 23 Feb 90 11:18:59 PST
Resent-Message-Id: <9002231918.AA17379@cis.Stanford.EDU>
Date: Fri 23 Feb 90 09:56:39-PST
From: Rick Reis <REIS@cis.stanford.edu>
Subject: An Unusual High Noon Talk
To: xcomx@sierra.stanford.edu, cis-people@glacier.stanford.edu,
cis-faculty@glacier.stanford.edu
Cc: Reis@cis.stanford.edu, miraflor@cis.stanford.edu
Message-Id: <VAX-MM(187)+TOPSLIB(118) 23-Feb-90 09:56:39.CIS.STANFORD.EDU>
Resent-Date: Fri 23 Feb 90 11:18:59-PST
Resent-From: Rick Reis <REIS@cis.stanford.edu>
Resent-To: ee-faculty@sierra.stanford.edu
Folks:
I wanted to drop you this note to tell you about an interesting and unusual
High Noon presentation on Friday, March 9 at noon in Skilling Auditorium.
As you know these popular lecturs established a couple of years ago by Dean
Gibbons are given by recently endowed professors who talk about their research
interests at a more general, popular level. Recent speakers from EE have
included Joe Goodman, John Hennessy, Jim Plummer and John LInvill to mention
a few.
The March 9th speaker, Professor Peter Bradshaw is from mechanical engineering
and the title of his talk is:
THE PHENOMENA OF TURBULENCE
or
What Does the Coffee in your Cup Have in Common with the Stars in the Galaxy?
Turbulence is the most complicated, most common, and most important kind of
fluid motion and this promises to be a very exciting talk that will include a
number of unusual demonstrations.
All of you are cordially invited and I hope to see as many of you as possible.
Cheers
Rick
-------
∂23-Feb-90 1357 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parcella '90 call for papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Feb 90 13:57:01 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04909; Fri, 23 Feb 90 11:12:33 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13177; Fri, 23 Feb 90 11:12:51 -0800
Message-Id: <9002231912.AA13177@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2567; Fri, 23 Feb 90 12:38:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2537; Fri, 23 Feb 90 12:38:36 CST
Date: Fri, 23 Feb 90 12:36:29 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Frank Dehne <dehne@cs.purdue.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Frank Dehne <dehne%cs.purdue.edu@VM1.NoDak.EDU>
Subject: parcella '90 call for papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
PARCELLA 90
Call for Papers
Fifth International Workshop on Parallel Processing by Cellular Automata and
Arrays
Berlin, G.D.R
September 17 - 21, 1990
Central Institute for Cybernetics and Information Processes
Academy of Sciences of the G.D.R, National IFIP Council of the G.D.R
in Cooperation with Hungarian Academy of Sciences, Cellware Ltd (Budapest)
The Parcella Workshop series is the first and, until now, the only series in the
field of Parallel Processing in the socialist countries of central and Eastern
Europe and the first one on Massive Parallelism in Europe. As in the foregoing
meetings Parcella 90 will present the landscape of research in these countries
and will be a meeting place with scientists from West Europe as well as
overseas. The organizers consider Berlin to be an excellent place for
initializing an international exchange of ideas and for cooperation.
TOPICS OF INTEREST:
Massive and Cellular finegrained Parallelism
Parallelism tending to massive
Selected Topics on Froitiers in Massive Parallel Computing
The following key words illustrate the wide range of interests:
Mathematical Foundations, Taxonomy of Architectures, Concepts of Systems
Languages, Programming, Theory of Algorithms, Data Flow, Design of Compilers,
Systolization, Design of Architectures and Systems, Memory and Memory Access,
Interconnection Networks, Routing Implementation, Performance Evaluation,
Simulation, Verification Numerical Application, Image Processing and
Modelling, Computational Geometry, Computer Graphics, AI and non-numerical
Applications, Graphalgorithms, Fault-tolerant Computing, Supercomputing,
Cellware, Neurocomputing and Connectionism, Optical Computing, etc.
CHAIRMEN-BOARD:
G. Wolf (Berlin), T. Legendi (Budapest), U. Schendel (Berlin-West)
SCIENTIFIC ADVISER: V. Kempe (Berlin)
MEMBERS OF THE INTERNATIONAL PROGRAMME COMMITTEE:
(non-final list)
H. Alt (Berlin-West), B. Buchberger (Linz), H. Burkhart (Zurich), R. Creutzburg
(Karlsruhe),P.-E. Danielson (Linkoeping) , F. Dehne (Ottawa), D. J. Evans
(Loughborough), V. Gritzyk (Lvov), W. Haendler (Erlangen), C. R. Jesshope
(Southampton), Ph. Jorrand (Grenoble), A. Jugel (Dresden), D. Jungmann
(Dresden), E. Katona (Szeged), H. T. Kung (Pittsburgh), St. Levialdi (Rome), D.
G. Maritsas (Patras), V. A. Melnikov (Moscow), L. Richter (Z∨rich), A.
Rosenfeld (Maryland), J.-R. Sack (Ottawa), J. Toth (Budapest), R. Vollmar
(Karlsruhe)
W. Wilhelmi (Berlin) acts as the head of the scientific programme
INVITED SPEAKERS:Presentations on different aspects of research within the field
of interest by members of the International Programme Committee and special
invited speakers.
SUBMITTED PAPERS:
5 copies of the full paper (max 6 pages) should be sent to the local chairman
not later than
March 31, 1990
via the conference office.
TYPE OF PRESENTATION:
Authors should make evident the potential or real gain of their results.
ADDITIONAL EVENTS:
An exhibition will be organized for prototypes and products in the field of
parallel machines. A poster session will be organized. Computer demonstrations
can be performed on the available machines (PC/XT, PC/AT and compatibles).
Round tables discussion: In case of any suggestions concerning these events
please contact the local or any other of the chairmen. Cultural and social
events are under preparation.
AWARDS:The IPC will award a prize for the best contribution of a young scientist
under 30.
PUBLICATION: It is intended to publish the proceedings by Eastern and Western
publishing houses. Author instructions available from the organizers.
REGISTRATION:
Please register not later than March 31, 1990. (Form available from the
organizers.) Please note that accomodation ordering and registration should be
combined.
CONFERENCE OFFICE:
Mrs. S Boettcher, (Head of the office), Phone: (Berlin) 2 03 72 264
Mailing address at the end of this announcement
PLACE:
Berlin, G.D.R., Haus der Ungarischen Kultur, Karl-Liebknecht-Strasse 9, Berlin,
1020
TIME: From Monday, September 17th to Friday, September 21st 1990.
Monday and Friday are half-conference days, i.e. the programme starts on Monday
afternoon and ends on Friday morning
LANGUAGE: Conference language is English
CONFERENCE FEE (including proceedings):
for non-speakers 450,- M/DM till 30.7.90; 600,- M/DM after
for speakers 300,- M/DM till 30.7.90; 400,- M/DM after
The fee should be transferred to
Dt. Aussenhandelsbank AG der DDR, Berlin
Account-No. 6836-20-20792
Coding 820 5525
Add your name please
Participants from Western countries have to pay in their own currencies
LIST OF DEADLINES:
Submission of papers and registration form
March 31
Acceptance/Rejection of papers
May 31
Final Programme
June 30
VISA:
Visa for prospective participants of Western countries will be organized by the
conference office. Please contact the organzers for an entry permission form.
Note please that the organizers need this form not later than 10 weeks before,
i.e. not later thanJune 30, 1990.
ACCOMMODATION: Accommodation can be organized on request
Prices for participants from socialist countries:
1 bedroom
130,- M
2 bedrooms
200,- M
Prices for participants from non-socialist countries:
1 bedroom
130,- DM
2 bedrooms
200,- DM
Send your ordering together with your registration form.
MAILING ADDRESS (also of conference office):
Zentralinstitut f∨r Kybernetik und Informationsprozesse
Kurstrasse 33
P.O.B. 1298
Berlin 1086 G.D.R.
Telex: 114536 zki dd
Fax: (Berlin) 2037 2301
Dr. G. Wolf (local chairman)
Phone: (Berlin) 20 37 23 13 direct.; 291 Secretary.
∂23-Feb-90 1417 Clancey.pa@Xerox.COM International String Competition Benefit Concert
Received: from Xerox.COM by SAIL.Stanford.EDU with TCP; 23 Feb 90 14:17:49 PST
Received: from Cabernet.ms by ArpaGateway.ms ; 23 FEB 90 13:59:59 PST
Date: 23 Feb 90 13:50 PST
From: Clancey.pa@Xerox.COM
Subject: International String Competition Benefit Concert
To: marty@cis.stanford.edu, mazzetti%ed.aaai.org@relay.cs.net,
Feigenbaum@sumex-aim.stanford.edu, Hayes-Roth@sumex-aim.stanford.edu,
Hinton@ri.cmu.edu, JMC-LIsts@sail.stanford.edu,
Lehnert%cs.umass.edu@relay.cs.net,
Nilsson%score.stanford.edu@relay.cs.net, RGSmith@slcs.slb.com,
Rich@mcc.com, bobrow.PA@Xerox.COM, buchanan@vax.cs.pitt.edu,
duda%polya%score.stanford.edu@relay.cs.net, clancey.pa@Xerox.COM,
engelmore@sumex-aim.stanford.edu, forbus@a.cs.uiuc.edu, hart@kl.sri.com,
hector%ai.toronto.edu@relay.cs.net,
hes%scrc-vallecito.symbolics.com@relay.cs.net,
marty%cis.stanford.edu@relay.cs.net, mckeown@cs.columbia.edu,
minsky%mc.lcs.mit.edu@relay.cs.net, reddy@fas.ri.cmu.edu,
swartout@vaxa.isi.edu, mazzetti@nilsson.ARPA, taglio@nilsson.ARPA,
tgd@cs.orst.edu
Message-ID: <900223-135959-5724@Xerox>
For those of you who will be arriving early for the AAAI Symposium in
March, I'd like to invite you to attend a benefit concert at my house in
Portola Valley on Sunday, March 25. Danny and Nils have attended in the
past, and I think they will vouch for the excellent performances and
unusual quality of the chamber setting.
The Stanford String Quartet will be playing Haydn's String Quartet Op. 54
#1 and Mendelssohn's String Quartet in D Op.44 A.
Alyssa Park, First Prize winner of the 1989 competition, will play the
violin as guest soloist: Mozart Sonata in G, K.301, Massenet Meditation
from Thais, and DeFalla Suite Populaire D'Espana.
Hor d'oeuvres from 3:15pm, Concert at 4:15, followed by dessert.
Donation $50.
Please contact me if you would like to receive a formal invitation.
Good enough reason, I think, to come to Palo Alto early!
Bill
∂25-Feb-90 1429 @Sunburn.Stanford.EDU:dill@hohum.Stanford.EDU batch 2 of admissions folders
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Feb 90 14:28:55 PST
Received: from hohum.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15467; Sun, 25 Feb 90 14:30:21 -0800
Received: by hohum.Stanford.EDU (5.57/Ultrix3.0-C)
id AA11302; Sun, 25 Feb 90 14:05:28 EST
Date: Sun, 25 Feb 90 14:05:28 EST
From: dill@hohum.Stanford.EDU (David Dill)
Message-Id: <9002251905.AA11302@hohum.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU
Subject: batch 2 of admissions folders
John,
I've left batch 2 of the admissions folders in the box
in front of Sharon's office.
Dave
∂26-Feb-90 0903 peters@russell.Stanford.EDU Meeting of researchers and staff on March 15
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 09:03:27 PST
Received: from localhost by russell.Stanford.EDU (4.1/inc-1.0)
id AA08657; Mon, 26 Feb 90 09:02:39 PST
Message-Id: <9002261702.AA08657@russell.Stanford.EDU>
To: researchers@russell.Stanford.EDU, administration@russell.Stanford.EDU
Subject: Meeting of researchers and staff on March 15
Date: Mon, 26 Feb 90 09:02:37 PST
From: peters@russell.Stanford.EDU
I have received the following memo from Prof. Robert Byer, Vice
Provost and Dean of Research. The meeting he has called with members
of CSLI gives each of us with a chance to state our views concerning
how Stanford should proceed in reducing its budget and streamlining
its operations.
--------------------------------------------------
On 8 February 1990, the Provost announced to the University a major
initiative to restructure the way in which Stanford conducts its
business.
Communication is an important part of the repositioning process as it
moves forward. I would like to meet with the faculty and staff of
each Independent Lab and Center to review the Provost's announcement
and to answer questions that arise from the announcement. I also want
to listen to suggestions and concerns about the repositioning effort
as it moves forward.
Therefore, I have asked your director to arrange for a meeting to last
up to one hour to discuss the repositioning effort. The meeting has
been arranged for Thursday 15 March 3:15 - 4:15.
∂26-Feb-90 1007 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Gene Golub to NAE
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 10:06:29 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24785; Mon, 26 Feb 90 10:06:05 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA12464; Mon, 26 Feb 90 09:59:03 PST
Date: Mon, 26 Feb 90 09:59:03 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002261759.AA12464@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Gene Golub to NAE
Cc: rh.crn@forsythe.stanford.edu
The news is out! Gene Golub has been elected to
the National Academy of Engineering. Finally, the
NAE is catching up with the times by electing our
distinguished computer scientists. Congratulations,
Gene!
-Nils
∂26-Feb-90 1115 bergman@Sunburn.Stanford.EDU funding announcements
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 11:14:56 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27414; Mon, 26 Feb 90 11:14:55 -0800
Date: Mon, 26 Feb 1990 11:14:55 GMT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: funding announcements
Message-Id: <CMM.0.88.636059695.bergman@Sunburn.Stanford.EDU>
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
NATIONAL SCIENCE FOUNDATION RESEARCH CAREERS FOR MINORITY SCHOLARS
This program provides grants to colleges and universities to assist
in the implementation of comprehensive research and academic
enrichment programs for minority undergraduate and graduate science
and engineering students. Highest priority will be given to
projects that significantly enhance the participating student's
chances of remaining in the science and engineering pipeline, and
going on to a career in science or engineering. Deadline: June 15,
1990.
NATIONAL SCIENCE FOUNDATION UNDERGRAD CURRICULUM AND COURSE
DEVELOPMENT IN ENGINEERING, MATHEMATICS AND THE SCIENCES
An expanded program to support major changes to reshape and
strengthen undergraduate courses, curricula and attendant
laboratories in engineering, mathematics and the sciences. This
year the program will emphasize proposals affecting
introductory-level courses, curricula and laboratories of
undergraduate degree programs. The phrase "introductory-level'
should be interpreted broadly to encompass all activities affecting
the learning environment and experiential education. A principal
goal of this program is to support fresh approaches and experiments
to undergraduate science education. Deadline: April 9, 1990.
∂26-Feb-90 1122 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Int'l Conf. on Database Theory - Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 11:22:15 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA08112; Mon, 26 Feb 90 11:21:58 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27624; Mon, 26 Feb 90 11:21:41 -0800
Message-Id: <9002261921.AA27624@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0839; Mon, 26 Feb 90 12:47:19 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0779; Mon, 26 Feb 90 12:47:15 CST
Date: Mon, 26 Feb 90 11:29:11 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"Moshe Y. Vardi" <VARDI@ALMADEN.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "Moshe Y. Vardi" <VARDI%ALMADEN.BITNET@VM1.NoDak.EDU>
Subject: Int'l Conf. on Database Theory - Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
ICDT-90
Call for Papers
Third International Conference on Database Theory
ICDT is the third in a series of biannual conferences on the theory of
databases held in beautiful European cities, Rome in 1986, Bruges in
1988 and now Paris in 1990.
TOPICS: We solicit papers describing original ideas and new results on
the foundations of databases, knowledge bases and object-oriented
databases. We suggest the following, although not exclusive, areas:
data models, data structures, complex objects,
logic and databases, deductive databases, knowledge representation,
object-oriented databases, database programming languages,
queries (languages, optimization...), incomplete information,
dependency theory, consistency, logical database design,
dynamic aspects (updates, temporal databases, schema evolution...),
transaction management (concurrency control, recovery...),
performance, physical database design, storage management,
database machines, distributed systems, database security,
user interfaces, database applications (spatial, statistical...).
INSTRUCTIONS: authors are invited to submit seven copies of an extended
abstract (no longer that fifteen double-spaced pages) before April 2,
1990, to the program chairmen:
Serge Abiteboul - ICDT'90 Paris Kanellakis - ICDT'90
INRIA Brown University
Domaine de Voluceau-Rocquencourt Computer Science Dept., PO Box 1910
78153 Le Chesnay Cedex - France Providence, RI 02912 - USA
Tel: 33/1.39.63.55.37 Tel: 1/401.863.76.47
Email: abitebou@inria.inria.fr Email: pck@cs.brown.edu
The selection will be based on originality and contribution to the
field. The proceedings of ICDT are traditionally published by Springer-
Verlag.
PROGRAM COMMITTEE:
S. Abiteboul (France) P. Atzeni (Italy) C. Beeri (Israel)
N. Bidoit (France) S. Cosmadakis (USA) R. Hull (USA)
T. Imielinski (USA) P. Kanellakis (USA) C. Lecluse (France)
M. Nivat (France) J. Paredaens (Belgium) H. Schek (Switzerland)
J. Schmidt (Germany) M. Vardi (USA) V. Vianu (USA)
LOCAL ORGANIZATION: Myriam Chazal, Sylviane Gosset, Michel Scholl
US COORDINATION: Victor Vianu (UCSD)
IMPORTANT DATES:
Deadline for submission: April 2, 1990
Notification of acceptance or rejection: July 7, 1990
Final paper due: August 15, 1990
Conference: December 13-15, 1990
INFORMATIONS: Myriam Chazal, INRIA, Service des Relations Exterieures,
Domaine de Voluceau-Rocquencourt, 78153 Le Chesnay Cedex, France.
Tel: 33/1.39.63.56.00. Telex: 697 033 F.
∂26-Feb-90 1127 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ICALP'90 Advance Programme
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 11:26:56 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA08514; Mon, 26 Feb 90 11:26:31 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27660; Mon, 26 Feb 90 11:22:36 -0800
Message-Id: <9002261922.AA27660@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0989; Mon, 26 Feb 90 12:50:30 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0960; Mon, 26 Feb 90 12:48:13 CST
Date: Mon, 26 Feb 90 11:29:40 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Prof M S Paterson <icalp@cs.warwick.ac.uk>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Prof M S Paterson <icalp%cs.warwick.ac.uk@VM1.NoDak.EDU>
Subject: ICALP'90 Advance Programme
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
ICALP'90 Advance Information
----------------------------
Location: University of Warwick, Coventry, UK
Outline of events: July 15 - 20, 1990
Sunday, eve. Arrival; registration
Monday, am Opening of Colloquium; registration
Monday, eve. Reception by Vice-Chancellor of University
Tuesday, eve. General Assembly of EATCS
Wed., aft.&eve. Excursions
Alternative A: Coventry Cathedral, Warwick Castle;
medieval banquet and musical entertainment
at Coombe Abbey
Alternative B: Warwick Castle, Stratford-upon-Avon;
Shakespeare play "Much Ado About Nothing"
Thursday, eve. Reception by the Lord Mayor of Coventry
at the Museum of British Road Transport;
Colloquium Dinner
Friday, aft. Close of Colloquium
Registration fee
The advance registration fee of 70 pounds (provisional) includes lunches,
refreshments during breaks, both Receptions, the Colloquium Dinner,
the excursions and a copy of the Proceedings.
A reduced registration fee of about 45 pounds for students will include all
the above except for the medieval banquet or Shakespeare play.
Accommodation
All accommodation will be in the University within easy walking distance
of the lecture room.
Standard rooms including dinner and breakfast are expected to be about
22 pounds per day. Some rooms with en suite bathrooms are available
for about 29 pounds per day.
For students, there will be a special rate of about 15 pounds for
bed & breakfast only.
Sponsorship
The main sponsor for ICALP'90 is ICL.
Other sponsors are ESPRIT, and IBM United Kingdom.
For further information please contact
Prof. M.S. Paterson
Department of Computer Science
University of Warwick
Coventry, CV4 7AL, UK
E-mail (Internet): ICALP@cs.warwick.ac.uk
------------------------------------------------
Papers to be presented:
Invited speakers
----------------
Local optimization and the traveling salesman problem
David Johnson (AT&T Bell Labs, USA)
Partial evaluation, self-application and types
Neil D. Jones (Univ. of Copenhagen, Denmark)
Recent themes in term rewriting
Jan Willem Klop (Centre for Maths. and Computer Science, N'lands)
LEDA: Efficient Reusable Software
Kurt Mehlhorn (coauthor: Stefan Naeher) (Univ. of Saarland, DDR)
Encoding the lambda calculus in a process calculus
Robin Milner (Univ. of Edinburgh, UK)
Contributed papers
------------------
On the Distributional Complexity of Disjointness
A.A. Razborov (Steklov Math. Inst., USSR)
On the Rectilinear Art Gallery Problem
Frank Hoffmann (Weierstrass Inst., DDR)
The Parallel Simplicity of Compaction and Chaining
Prabhakar Ragde (Univ. of Waterloo, Canada)
A Proof System for the Language POOL
Frank de Boer (Centre for Maths. and Computer Science, N'lands)
The Importance of the Left Merge Operator in Process Algebras
Faron Moller (Univ. of Edinburgh, UK)
Finitary Semirings, Algebraic Systems and Pushdown Automata
Werner Kuich (Techn. Univ. of Vienna, Austria)
A Complete System of B-Rational Identities
Daniel Krob (Univ. of Rouen, France)
Communication among Relations
A. Rabinovich (Tel Aviv Univ., Israel)
B.A. Trakhtenbrot (Tel Aviv Univ., Israel)
A Theory of Communicating Processes with Value-passing
M. Hennessy (Univ. of Sussex, UK)
A Ingolfsdottir (Univ. of Sussex, UK)
Can a Maximum Flow be Computed in o(nm) Time?
Joseph Cheriyan (Univ. of Saarland, W. Germany)
Torben Hagerup (Univ. of Saarland, W. Germany)
Kurt Mehlhorn (Univ. of Saarland, W. Germany)
Additional Queries to Random and Pseudorandom Oracles
Ronald V. Book (UC Santa Barbara, USA)
Jack H. Lutz (Iowa State Univ., USA)
Shouwen Tang (Beijing Computer Inst., PR China)
Static Correctness of Hierarchical Procedures
Michael I. Schwartzbach (Aarhus Univ., Denmark)
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid
Victor Pan (SUNY at Albany & Lehman Coll. CUNY, USA)
John Reif (Duke Univ., USA)
Stability and Sequentiality in Dataflow Networks
Prakash Panangaden (Cornell Univ., USA)
Vasant Shanbhogue (Cornell Univ., USA)
Eugene W. Stark (SUNY at Stony Brook, USA)
Concurrency, Automata and Domains
Manfred Droste (Univ. GHS Essen, GDR)
Provable Computable Functions on Abstract Data Types
J.V. Tucker (Univ. Coll. Swansea, UK)
S.S. Wainer (Univ. of Leeds, UK)
J.I. Zucker (McMaster Univ., Canada)
Playing with RAM time and space
Juraj Wiedermann (VUSEI-AR, Czechoslovakia)
Computing Boolean Functions on Anonymous Networks
Evangelos Kranakis (Centre for Maths. and Com. Science, N'lands)
Danny Krizanc (C. for Math/C.Sci., N'lands & U. of Rochester, USA)
Jacob van den Berg (C. for Maths. and Computer Science, N'lands)
Equational Formulas in Order-Sorted Algebras
Hubert Comon (Univ. of Paris South, France)
A Monte-Carlo-type Dictionary with Worst Case Constant Time
per Instruction
Martin Dietzfelbinger (Univ. GH Paderborn, FRG)
Friedhelm Meyer auf der Heide (Univ. GH Paderborn, FRG)
On the Composition of Zero-Knowledge Proof Systems
Oded Goldreich (Technion, Israel)
Hugo Krawczyk (Technion, Israel)
Markov Decision Processes and Regular Events
Costas Courcoubetis (AT&T Bell Labs, USA)
Mihalis Yannakakis (AT&T Bell Labs, USA)
Compositionality Through an Operational Semantics of Contexts
Kim G. Larsen (Aalborg Univ., Denmark)
Liu Xinxin (Aalborg Univ., Denmark)
Boolean closure and unambiguity of rational sets
Maryse Pelletier (Univ. of Paris 6, France)
Polynomial-time approximation algorithms for the Ising model
Mark Jerrum (Univ. of Edinburgh, UK)
Alistair Sinclair (Univ. of Edinburgh, UK)
On Integer Sorting and Parallel Hashing
Yossi Matias (Tel-Aviv Univ., Israel)
Uzi Vishkin (Tel-Aviv Univ., Israel & Univ. of Maryland, USA)
Two-way automata with multiplicities
M. Anselmo (Univ. of Paris 7, France & Univ. of Palermo, Italy)
Determining the Separation of Preprocessed Polyhedra - a Unified Approach
David P. Dobkin (Princeton Univ., USA)
David G. Kirkpatrick (Univ. of BC, Canada)
A Formal Study of Learnability via Queries
Osamu Watanabe (Tokyo Inst. of Technology, Japan)
On non-counting regular classes
Aldo de Luca (Univ. of Rome "La Sapienza", Italy)
Stefano Varrichio (U. of Rome "La Sap." & Inst. of Cyb. CNR, Italy)
Algebraic Properties of Idempotent Substitutions
Catuscia Palamidessi (Univ. of Pisa, Italy)
Proving Partial Order Liveness Properties
Doron Peled (Technion, Israel)
Amir Pnueli (Weizmann Inst., Israel)
Structural and Behavioural Equivalences of Networks
Joachim Parrow (Swedish Inst. of Computer Science, Sweden)
A Domain-theoretic Model for a Higher-order Process Calculus
Radhakrishnan Jagadeesan (Cornell Univ., USA)
Prakash Panangaden (Cornell Univ., USA)
A Complete and Decidable Proof System for Call-by-Value Equalities
Jon G. Riecke (MIT, USA)
Randomized Incremental Construction of Delaunay and Voronoi Diagrams
Leonidas J. Guibas (Stanford Univ. & DEC Sys. Res. Center, USA)
Donald E. Knuth (Stanford Univ., USA)
Micha Sharir (Courant Inst.., USA & Tel Aviv Univ., Israel)
An Input-Size/Output-Size Trade-Off in the Time-Complexity of
Rectilinear Hidden Surface Removal
Michael T. Goodrich (Johns Hopkins Univ., USA)
Mikhail J. Atallah (Purdue Univ., USA)
Mark H. Overmars (Univ. of Utrecht, Netherlands)
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction
Richard Cole (Courant Inst., USA )
Michael T. Goodrich (Johns Hopkins Univ., USA)
Colm O Dunlaing (Trinity College Dublin, Rep. Ireland)
Language Learning by a "Team"
Sanjay Jain (Univ. of Rochester, USA)
Arun Sharma (Univ. of Delaware, USA)
Decomposition of Partial Commutations
Mireille Clerbout (Univ. of Lille Flandres Artois, France)
Michel Latteux (Univ. of Lille Flandres Artois, France)
Yves Roos (Univ. of Lille Flandres Artois, France)
On-Line Graph Algorithms with SPQR-Trees
Giuseppe Di Battista (Univ. of Rome "La Sapienza", Italy)
Roberto Tamassia (Brown Univ., USA)
Analytic variations on the common subexpression problem
Philippe Flajolet (INRIA, France)
Paolo Sipala (Univ. of Trieste, Italy)
Jean-Marc Steyaert (Ecole Polytechnique, France)
Approximation of Convex Polygons
Helmut Alt (Free Univ. Berlin, FRG)
Johannes Bloemer (Free Univ. Berlin, FRG)
Michael Godeau (Free Univ. Berlin, FRG)
Hubert Wagener (Techn. Univ. Berlin, FRG)
Generic terms having no polymorphic types
Sophie Malecki (Univ. of Paris 7, France)
On Parallelizing Graph-Partitioning Heuristics
John E. Savage (Brown Univ., USA)
Markus G. Wloka (Brown Univ., USA)
Operational and Algebraic Semantics for Facile: a Symmetric
Integration of Concurrent and Functional Programming
Alessandro Giacalone (SUNY at Stony Brook, USA)
Prateek Mishra (SUNY at Stony Brook, USA)
Sanjiva Prasad (SUNY at Stony Brook, USA)
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
Jan Friso Groote (Centre for Maths. and Computer Science, N'lands)
Frits Vaandrager (Centre for Maths. and Comp. Science, N'lands)
A new approach to maximum matching in general graphs
Norbert Blum (Univ. of Bonn, FRG)
Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems
Rakesh M. Verma (Univ. of Houston, USA)
I.V. Ramakrishnan (SUNY at Stony Brook, USA)
Automata for Modeling Real-Time Systems
Rajeev Alur (Stanford Univ., USA)
David Dill (Stanford Univ., USA)
Iterated Substitutions and Locally Catenative Systems:
a Decidability Result in the Binary Case
Christian Choffrut (Univ. of Rouen, France)
Nondeterministic computations in sublogarithmic space
and space constructibility
Viliam Geffert (Univ. of Safarik, Czechoslovakia)
∂26-Feb-90 1147 sloan@Sunburn.Stanford.EDU Fire Alarm Test
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 11:47:28 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA28333; Mon, 26 Feb 90 11:46:55 -0800
Date: Mon, 26 Feb 1990 11:46:52 GMT
From: Yvette Sloan <sloan@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, mjhstaff@Sunburn.Stanford.EDU
Subject: Fire Alarm Test
Message-Id: <CMM.0.88.636061612.sloan@Sunburn.Stanford.EDU>
For your information: Fire alarms will sound at noon tomorrow (2/27) in
Margaret Jacks Hall. This is a test. --Yvette
∂26-Feb-90 1418 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU parcella '90 call for papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 14:16:59 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04909; Fri, 23 Feb 90 11:12:33 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13177; Fri, 23 Feb 90 11:12:51 -0800
Message-Id: <9002231912.AA13177@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2567; Fri, 23 Feb 90 12:38:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2537; Fri, 23 Feb 90 12:38:36 CST
Date: Fri, 23 Feb 90 12:36:29 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Frank Dehne <dehne@cs.purdue.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Frank Dehne <dehne%cs.purdue.edu@VM1.NoDak.EDU>
Subject: parcella '90 call for papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
PARCELLA 90
Call for Papers
Fifth International Workshop on Parallel Processing by Cellular Automata and
Arrays
Berlin, G.D.R
September 17 - 21, 1990
Central Institute for Cybernetics and Information Processes
Academy of Sciences of the G.D.R, National IFIP Council of the G.D.R
in Cooperation with Hungarian Academy of Sciences, Cellware Ltd (Budapest)
The Parcella Workshop series is the first and, until now, the only series in the
field of Parallel Processing in the socialist countries of central and Eastern
Europe and the first one on Massive Parallelism in Europe. As in the foregoing
meetings Parcella 90 will present the landscape of research in these countries
and will be a meeting place with scientists from West Europe as well as
overseas. The organizers consider Berlin to be an excellent place for
initializing an international exchange of ideas and for cooperation.
TOPICS OF INTEREST:
Massive and Cellular finegrained Parallelism
Parallelism tending to massive
Selected Topics on Froitiers in Massive Parallel Computing
The following key words illustrate the wide range of interests:
Mathematical Foundations, Taxonomy of Architectures, Concepts of Systems
Languages, Programming, Theory of Algorithms, Data Flow, Design of Compilers,
Systolization, Design of Architectures and Systems, Memory and Memory Access,
Interconnection Networks, Routing Implementation, Performance Evaluation,
Simulation, Verification Numerical Application, Image Processing and
Modelling, Computational Geometry, Computer Graphics, AI and non-numerical
Applications, Graphalgorithms, Fault-tolerant Computing, Supercomputing,
Cellware, Neurocomputing and Connectionism, Optical Computing, etc.
CHAIRMEN-BOARD:
G. Wolf (Berlin), T. Legendi (Budapest), U. Schendel (Berlin-West)
SCIENTIFIC ADVISER: V. Kempe (Berlin)
MEMBERS OF THE INTERNATIONAL PROGRAMME COMMITTEE:
(non-final list)
H. Alt (Berlin-West), B. Buchberger (Linz), H. Burkhart (Zurich), R. Creutzburg
(Karlsruhe),P.-E. Danielson (Linkoeping) , F. Dehne (Ottawa), D. J. Evans
(Loughborough), V. Gritzyk (Lvov), W. Haendler (Erlangen), C. R. Jesshope
(Southampton), Ph. Jorrand (Grenoble), A. Jugel (Dresden), D. Jungmann
(Dresden), E. Katona (Szeged), H. T. Kung (Pittsburgh), St. Levialdi (Rome), D.
G. Maritsas (Patras), V. A. Melnikov (Moscow), L. Richter (Z∨rich), A.
Rosenfeld (Maryland), J.-R. Sack (Ottawa), J. Toth (Budapest), R. Vollmar
(Karlsruhe)
W. Wilhelmi (Berlin) acts as the head of the scientific programme
INVITED SPEAKERS:Presentations on different aspects of research within the field
of interest by members of the International Programme Committee and special
invited speakers.
SUBMITTED PAPERS:
5 copies of the full paper (max 6 pages) should be sent to the local chairman
not later than
March 31, 1990
via the conference office.
TYPE OF PRESENTATION:
Authors should make evident the potential or real gain of their results.
ADDITIONAL EVENTS:
An exhibition will be organized for prototypes and products in the field of
parallel machines. A poster session will be organized. Computer demonstrations
can be performed on the available machines (PC/XT, PC/AT and compatibles).
Round tables discussion: In case of any suggestions concerning these events
please contact the local or any other of the chairmen. Cultural and social
events are under preparation.
AWARDS:The IPC will award a prize for the best contribution of a young scientist
under 30.
PUBLICATION: It is intended to publish the proceedings by Eastern and Western
publishing houses. Author instructions available from the organizers.
REGISTRATION:
Please register not later than March 31, 1990. (Form available from the
organizers.) Please note that accomodation ordering and registration should be
combined.
CONFERENCE OFFICE:
Mrs. S Boettcher, (Head of the office), Phone: (Berlin) 2 03 72 264
Mailing address at the end of this announcement
PLACE:
Berlin, G.D.R., Haus der Ungarischen Kultur, Karl-Liebknecht-Strasse 9, Berlin,
1020
TIME: From Monday, September 17th to Friday, September 21st 1990.
Monday and Friday are half-conference days, i.e. the programme starts on Monday
afternoon and ends on Friday morning
LANGUAGE: Conference language is English
CONFERENCE FEE (including proceedings):
for non-speakers 450,- M/DM till 30.7.90; 600,- M/DM after
for speakers 300,- M/DM till 30.7.90; 400,- M/DM after
The fee should be transferred to
Dt. Aussenhandelsbank AG der DDR, Berlin
Account-No. 6836-20-20792
Coding 820 5525
Add your name please
Participants from Western countries have to pay in their own currencies
LIST OF DEADLINES:
Submission of papers and registration form
March 31
Acceptance/Rejection of papers
May 31
Final Programme
June 30
VISA:
Visa for prospective participants of Western countries will be organized by the
conference office. Please contact the organzers for an entry permission form.
Note please that the organizers need this form not later than 10 weeks before,
i.e. not later thanJune 30, 1990.
ACCOMMODATION: Accommodation can be organized on request
Prices for participants from socialist countries:
1 bedroom
130,- M
2 bedrooms
200,- M
Prices for participants from non-socialist countries:
1 bedroom
130,- DM
2 bedrooms
200,- DM
Send your ordering together with your registration form.
MAILING ADDRESS (also of conference office):
Zentralinstitut f∨r Kybernetik und Informationsprozesse
Kurstrasse 33
P.O.B. 1298
Berlin 1086 G.D.R.
Telex: 114536 zki dd
Fax: (Berlin) 2037 2301
Dr. G. Wolf (local chairman)
Phone: (Berlin) 20 37 23 13 direct.; 291 Secretary.
∂26-Feb-90 1429 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 14:29:40 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04763; Mon, 26 Feb 90 14:30:12 -0800
Date: Mon, 26 Feb 1990 14:30:11 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU
Cc: staff-rep@cs.Stanford.EDU, chandler@Sunburn.Stanford.EDU,
rosenberg%hplsr@hplabs.hp.com
Subject: Tomorrow's faculty lunch
Message-Id: <CMM.0.88.636071411.chandler@Sunburn.Stanford.EDU>
Professor Phil Hanawalt who is the committee chair will join us tomorrow to
give us the latest report from the Senate Committee on the Professoriate.
∂26-Feb-90 1435 chandler@Sunburn.Stanford.EDU David Williams
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 14:34:50 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA05185; Mon, 26 Feb 90 14:34:52 -0800
Date: Mon, 26 Feb 1990 14:34:51 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: David Williams
Message-Id: <CMM.0.88.636071691.chandler@Sunburn.Stanford.EDU>
I have a bill from the Stanford Terrace Inn billing CSD for David Williams'
stay 2/9-10/90. Does anyone know anything about this?
∂26-Feb-90 1516 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU The 15th Theory Day at Columbia University
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 15:15:58 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23446; Mon, 26 Feb 90 15:15:56 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07410; Mon, 26 Feb 90 15:15:59 -0800
Message-Id: <9002262315.AA07410@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7742; Mon, 26 Feb 90 17:15:30 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7715; Mon, 26 Feb 90 17:15:27 CST
Date: Mon, 26 Feb 90 15:48:06 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Zvi Galil <galil@cs.columbia.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Zvi Galil <galil%cs.columbia.edu@VM1.NoDak.EDU>
Subject: The 15th Theory Day at Columbia University
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
THE 15TH THEORY DAY
at Columbia University
SPONSORED BY THE DEPARTMENT OF COMPUTER SCIENCE
FRIDAY, MARCH 30, 1990
10:00 PROFESSOR PERSI DIACONIS
Harvard University
COMBINATORICS AND MAGIC TRICKS
11:00 PROFESSOR DAN E. WILLARD
SUNY at Albany
FASTER THAN NlogN SORTING AND BETTER THAN LOGARITHMIC RETRIEVAL
WITH FUSION TREES
2:00 DR. PRABHAKAR RAGHAVAN
IBM T.J. Watson Research Center
RANDOM WALKS, ELECTRIC NETWORKS AND ALGORITHMIC APPLICATIONS
3:00 PROFESSOR ADI SHAMIR
Weizmann Institute
IP=PSPACE
Coffee will be available at 9:30 am.
All lectures will be in the Kellogg Conference Center on the fifteenth
floor of the International Affairs Building, 118th Street and
Amsterdam Avenue.
The lectures are free and open to the public.
Call (212) 854-2736 for more information.
Theory Day is supported in part by a grant from the National Science
Foundation.
∂26-Feb-90 1622 chandler@Sunburn.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 16:21:55 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11607; Mon, 26 Feb 90 16:22:24 -0800
Date: Mon, 26 Feb 1990 16:22:23 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Publication
Message-Id: <CMM.0.88.636078143.chandler@Sunburn.Stanford.EDU>
Here it is folks...hot off the press from NSF...
CISE Educations Infrastructure Program Announcement.
Dectorate for Computer and Information Science and Engineering Office of
Cross-Disciplinary Activities.
Let me know if you're interested in seeing this....I'll send you a copy.
∂26-Feb-90 1730 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for Papers Advances in Logic Programming and Automated
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Feb 90 17:30:37 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00672; Mon, 26 Feb 90 17:30:30 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13665; Mon, 26 Feb 90 17:30:48 -0800
Message-Id: <9002270130.AA13665@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2854; Mon, 26 Feb 90 18:59:09 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2766; Mon, 26 Feb 90 18:59:06 CST
Date: Mon, 26 Feb 90 18:28:32 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Ralph Wilkerson <ralphw@mcs213k.cs.umr.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Ralph Wilkerson <ralphw%cs.umr.edu@VM1.NoDak.EDU>
Subject: Call for Papers Advances in Logic Programming and Automated
Reasoning
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR MANUSCRIPTS
ADVANCES IN LOGIC PROGRAMMING AND
AUTOMATED REASONING
edited by Ralph W. Wilkerson, University of Missouri-Rolla
This annual series will review new research contributions of the
methods of logic in computer science. Contributions from leading
researchers and practitioners will be sought. The intended audience
for the series is professionals in universities, institutes, private
industry, and the private sector. The series is designed to
stimulate and sustain new, productive lines of investigation into the
theory and applications of symbolic and algebraic computing techniques
as it relates to logic programming and automated deduction.
Contributions should be original research of high quality and not
previously published. The manuscripts can be tutorial in nature.
Suggested topics include, but are not limited to:
equational logic and applications
parallel methodologies
combinatorial logic and functional programming
term rewriting systems
control of logic programs
completion procedures
syntactic theories and unification
design and implementation of deduction systems
logical methods of knowledge representation
logic based inference techniques
program synthesis and verification
non-monotonic reasoning systems
ABLEX Publishing and the Advances Series Editor invite you to submit a 1 page
proposal to the editor for consideration. Please contact the series editor
for editorial guidelines for manuscripts.
Dr. Ralph W. Wilkerson, Advances Series Editor
Department of Computer Science
University of Missouri-Rolla
Rolla, MO 65401
Phone: (314)-341-4653
Email: ralphw@gator.cs.umr.edu
Bitnet: c3267@umrvmb
∂26-Feb-90 1957 LOGMTC-mailer seminar
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
SEMANTICS OF SPECIFICATION LANGUAGES
Enn Tyugu
Estonian Academy of Sciences
Tallinn, USSR
Friday, March 2, 3:15pm
MJH 252
We present a kernel of declarative languages with multiple
inheritance, usage of prototypes and restricted polymorphism.
Semantics of a specification written in this language is viewed
as a list of axioms obtained from the specification and applicable
for constructively deriving solvability proof needed for deductive
program synthesis.
We can observe similarity between the contructs of our
declarative language and type expressions of the intuitionistic
type theory. This enables us to define another semantics of this
language in terms of types and to relate this semantics to the
axiomatic semantics mentioned above.
∂27-Feb-90 0944 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU This week's talk
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 09:44:34 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12831; Tue, 27 Feb 90 09:43:00 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-eef) id AA12704; Tue, 27 Feb 90 09:42:12 -0800
Message-Id: <9002271742.AA12704@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: This week's talk
Date: Tue, 27 Feb 90 09:42:09 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
The speaker at AFLB this Thursday at 12:00pm in MJH 252 will be Jack
Edmonds, who is currently visiting the CS and OR departments at
Stanford. The title of his talk will be "Existentially Polytime
Predicate Formulas."
∂27-Feb-90 1030 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 10:30:50 PST
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA06255; Tue, 27 Feb 90 10:20:13 PST
Date: Tue 27 Feb 90 10:20:13-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <636142813.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, March 1, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Pat Hayes, Computer Science, Xerox PARC
Topic: "Time Points or Time Intervals? Problems in
Axiomatising Common Sense"
ABSTRACT
--------
When we think about time, do we think of it as
consisting of a sequence of clock-times, or as consisting of
intervals of time during which things happen? In trying to
formalise these perspectives so that we can make a machine
imitate our thinking, we find that apparently simple axioms
have unforseen, unintuitive consequences. This talk is an
informal review of the history of trying to get a clear,
consistent description of time, and the pitfalls we meet
along the way.
Following week, March 8:
Susan Stucky, Institute for Research on Learning
"The Radically Efficient Agent in Context"
-------
∂27-Feb-90 1159 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU Abstract for this week's talk
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 11:59:28 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21039; Tue, 27 Feb 90 11:54:44 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-eef) id AA12848; Tue, 27 Feb 90 11:53:52 -0800
Message-Id: <9002271953.AA12848@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: Abstract for this week's talk
Date: Tue, 27 Feb 90 11:53:48 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
The following is the abstract for this Thursday's talk (12:00pm, MJH 252):
Jack Edmonds
Existentially polynomial formulas.
"Expressible by an EP-formula" is what defines a predicate to be in
the class NP (or EP). We will give a particularly simple proof of the
Cook-Levin NP-Completeness theorem, and also show how EP-formulas have
a more positive use.
∂27-Feb-90 1303 LOGMTC-mailer Mints seminar series -- reminder
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker: Grigori Mints, Institute of Cybernetics, Tallinn 200108, Estonia
Title: Resolution Calculi for Propositional Modal Logics
Time: Noon, Wednesday February 28, 1990
Place: 352 Margaret Jacks Hall (Stanford Computer Science)
∂27-Feb-90 1424 chandler@Sunburn.Stanford.EDU test
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 14:24:23 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA00968; Tue, 27 Feb 90 14:24:30 -0800
Date: Tue, 27 Feb 1990 14:24:27 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: baskett%forest.sgi.com@sgi.sgi.com, bigelow@cs.Stanford.EDU,
binford@cs.Stanford.EDU, chandler@cs.Stanford.EDU,
cheriton@cs.Stanford.EDU, cleron@cs.Stanford.EDU, chor@cs.Stanford.EDU,
dantzig@cs.Stanford.EDU, delagi@sumex-aim.Stanford.EDU, nanni@mojavi,
dill@cs.Stanford.EDU, engelmore@sumex-aim.Stanford.EDU,
feigenbaum@cs.Stanford.EDU, fisher@cs.Stanford.EDU,
floyd@cs.Stanford.EDU, m@sierra.Stanford.EDU, gabriel@cs.Stanford.EDU,
geddis@neon.Stanford.EDU, genesereth@cs.Stanford.EDU,
gibbons@sierra.Stanford.EDU, gill@cs.Stanford.EDU,
ginsberg@cs.Stanford.EDU, goldberg@neon.Stanford.EDU,
goldberg@cs.Stanford.EDU, golub@cs.Stanford.EDU,
guibas@cs.Stanford.EDU, gupta@cs.Stanford.EDU, halpern@cs.Stanford.EDU,
hayes@pa@xerox.com, bhayes-roth@sumex-aim.Stanford.EDU,
hennessy@cs.Stanford.EDU, herrito@cs.Stanford.EDU,
horowitz@amadeus.Stanford.EDU, jones@cs.Stanford.EDU,
ketonen@cs.Stanford.EDU, khatib@cs.Stanford.EDU, knuth@cs.Stanford.EDU,
kruger@sierra.Stanford.EDU, lam@cs.Stanford.EDU,
latombe@cs.Stanford.EDU, lenat@cs.Stanford.EDU,
lifschitz@cs.Stanford.EDU, linton@cs.Stanford.EDU,
luckham@cs.Stanford.EDU, vivluo@sunburn.Stanford.EDU,
manna@cs.Stanford.EDU, mccarthy@cs.Stanford.EDU,
mccluskey@cs.Stanford.EDU, meng@tilden.Stanford.EDU, miller@kl.sri.com,
mitchell@cs.Stanford.EDU, mont-reynaud@cs.Stanford.EDU,
motwani@cs.Stanford.EDU, musen@cs.Stanford.EDU, nii@cs.Stanford.EDU,
nilsson@cs.Stanford.EDU, oliger@cs.Stanford.EDU, owicki@decwrl.dec.com,
pereyra@cs.Stanford.EDU, plotkin@cs.Stanford.EDU,
ponce@coyote.Stanford.EDU, pratt@cs.Stanford.EDU,
reges@cs.Stanford.EDU, reid@cs.Stanford.EDU,
rindfleisch@sumex-aim.Stanford.EDU, rosenschein@teleos.com,
der@psych.Stanford.EDU, samuel@cs.Stanford.EDU, shoham@cs.Stanford.EDU,
shortliffe@cs.Stanford.EDU, smith@cs.Stanford.EDU, clt@cs.Stanford.EDU,
tenenbaum@cis.Stanford.EDU, tobagi@cs.Stanford.EDU,
ullman@cs.Stanford.EDU, ungar@amadeus.Stanford.EDU,
vardi@cs.Stanford.EDU, waldinger@cs.Stanford.EDU,
weise@cs.Stanford.EDU, wheaton@cs.Stanford.EDU,
wiederhold@cs.Stanford.EDU, winograd@cs.Stanford.EDU
Subject: test
Message-Id: <CMM.0.88.636157467.chandler@Sunburn.Stanford.EDU>
test
∂27-Feb-90 1505 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Folk Theorem: NC↑1 and EREW PRAMs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 15:05:14 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA07685; Tue, 27 Feb 90 15:05:12 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02822; Tue, 27 Feb 90 15:05:32 -0800
Message-Id: <9002272305.AA02822@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4923; Tue, 27 Feb 90 16:31:46 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4879; Tue, 27 Feb 90 16:31:41 CST
Date: Tue, 27 Feb 90 16:30:25 CST
Reply-To: Eric Allender <allender%cs.rutgers.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Eric Allender <allender%cs.rutgers.edu@VM1.NoDak.EDU>
Subject: Folk Theorem: NC↑1 and EREW PRAMs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Can anyone clarify the status of the following "folk theorem":
NC↑1 = log time on an EREW PRAM.
In particular
* Is it correct?
* If so, where is it proved?
* Is this question discussed anywhere?
Note that this is NOT the definition of NC↑1 (although one occasionally
sees a paper in which ANY log-time algorithm -- or at least log time
on an EREW PRAM -- is called an NC↑1 algorithm).
Instead, NC↑1 is usually defined in terms of (uniform) families of
log-depth fan-in 2 circuits of AND and OR gates, or in terms of Boolean
formulae, or in terms of alternating Turing machines, or in terms of
Bounded-Width Branching Programs, or in any of many other equivalent
formulations.
Note that various other models of PRAM are known to correspond exactly
to complexity classes. For example:
log time on a CRCW PRAM = AC↑1 [Stockmeyer and Vishkin]
log time on a CROW PRAM = log(DCFL) [Dymond and Ruzzo]
(This last result requires some explanation. CROW means "Concurrent
Read Owner Write"; the "owner write" restriction means that a processor
can only write into memory locations that it "owns". Thus this gives
a policy for enforcing the "exclusive write" restriction. The class
of sets reducible to determistic context-free languages is log(DCFL).)
It is easy to define something like an "Owner Read Owner Write" PRAM
that corresponds exactly to NC↑1, but such a model seems quite restrictive.
Thus it would be nice if NC↑1 really does correspond to EREW PRAMs.
Note that it is not a-priori obvious that a CROW PRAM can simulate an
EREW PRAM (although log(DCFL) clearly contains NC↑1).
Any pointers will be appreciated,
-- Eric Allender
∂27-Feb-90 1629 hemenway@Sunburn.Stanford.EDU Change in Sunday Meeting Time
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 16:29:38 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07471; Tue, 27 Feb 90 16:30:32 -0800
Date: Tue, 27 Feb 1990 16:30:30 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Change in Sunday Meeting Time
Message-Id: <CMM.0.88.636165030.hemenway@Sunburn.Stanford.EDU>
Would everyone (excepting John Mitchell and Andy) still be able
to make it to the meeting if we changed the start time to 1:00 pm
(from the present 2:30)??
Sharon
∂27-Feb-90 1645 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU IBM nominations for fellowships -- CSD students only
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 16:45:42 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08410; Tue, 27 Feb 90 16:46:01 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA28796; Tue, 27 Feb 90 16:45:05 -0800
Date: Tue, 27 Feb 1990 16:45:04 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@Hudson.Stanford.EDU
Subject: IBM nominations for fellowships -- CSD students only
Message-Id: <CMM.0.88.636165904.tajnai@Hudson.Stanford.EDU>
IBM has called for nominations of 2 students from CSD. We have to have
the material mailed by Friday, March 23, so we must move quickly.
Candidates must be: CSD PHD students
top of the class
advanced students.
Must have passed quals
Recommend:
Student expects to graduate by June 1992 (it is usually renewed for a
second year).
Student who has published
Student who has started thesis research
We are not guaranteed a fellowship. The students must compete with
students from other universities.
Since the nominees have to gather together letters of recommendation,
transcripts, etc., we must allow them time. Decision must be made by
Monday, so please do not delay in sending in your nominations.
Carolyn Tajnai, Chairman
CSD Fellowship Committee
Note: citizenship is not a factor.
∂27-Feb-90 1705 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: IBM nominations for fellowships -- CSD students only
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Feb 90 17:05:18 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09597; Tue, 27 Feb 90 17:05:29 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA28945; Tue, 27 Feb 90 17:04:33 -0800
Date: Tue, 27 Feb 1990 17:04:33 PST
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
Cc: faculty@Hudson.Stanford.EDU
Subject: Re: IBM nominations for fellowships -- CSD students only
In-Reply-To: Your message of Tue, 27 Feb 1990 16:45:04 PST
Message-Id: <CMM.0.88.636167073.ango@Hudson.Stanford.EDU>
Carolyn,
I would like to nominate Edith Cohen. She meets all the requirements
mentioned in your message. Her nomination for the IBM fellowship is
especially appropriate since she conducts joint research with Nimrod
Meggido (a researcher at IBM Almaden), and have co-authored two papers
with him.
--Andrew
∂28-Feb-90 0737 chandler@Sunburn.Stanford.EDU Yet another pub....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 07:37:28 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26197; Wed, 28 Feb 90 07:37:47 -0800
Date: Wed, 28 Feb 1990 7:37:46 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Yet another pub....
Message-Id: <CMM.0.88.636219466.chandler@Sunburn.Stanford.EDU>
Coordination Theory and Collaboration Technology - Special Initiative -
Proposal Deadline: 4/9/90.....put out by NSF Directorate for Computer &
Information Science & Engineering. Let me know if you would like a copy and
I'll get one to you.
∂28-Feb-90 0900 stager@Sunburn.Stanford.EDU Fall Quarter Tau Beta Pi Survey Results
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 09:00:28 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA28198; Wed, 28 Feb 90 09:00:36 -0800
Date: Wed, 28 Feb 1990 9:00:35 GMT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: commons@Sunburn.Stanford.EDU, stager@Sunburn.Stanford.EDU,
jimenez@Sunburn.Stanford.EDU
Subject: Fall Quarter Tau Beta Pi Survey Results
Message-Id: <CMM.0.88.636224435.stager@Sunburn.Stanford.EDU>
I've checked again with the School of Engineering to find out what's going
on with the TBP surveys from Fall Qtr. There continue to be software
problems, so survey results are still not available. They hope to have
things up and running in the next week or so.
I'll keep you updated.
Claire
∂28-Feb-90 1143 robertso@sierra.Stanford.EDU Majors Event, April 18 (From: G. Franklin)
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 11:43:50 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Wed, 28 Feb 90 11:38:17 PST
Date: Wed, 28 Feb 90 11:38:17 PST
From: robertso@sierra.Stanford.EDU (Maria Robertson)
To: ee-faculty@sierra.Stanford.EDU
Subject: Majors Event, April 18 (From: G. Franklin)
Message-Id: <CMM.0.88.636233895.robertso@>
Each year the Undergraduate Advisory Center hosts a fair for undeclared
undergraduates to help them select a major. EE will have at the fair and we
would like to have at least one faculty member there during the hours of
10am-2pm. Please let me know if you would be wiling to participate and what
hours you would be available. We will set up a schedule after the start of
Spring Quarter.
∂28-Feb-90 1334 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU expansion
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 13:34:27 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05842; Wed, 28 Feb 90 13:34:36 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA13961; Wed, 28 Feb 90 13:27:37 PST
Date: Wed, 28 Feb 90 13:27:37 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9002282127.AA13961@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: expansion
In my note congratulating Gene Golub on his
election to the NAE I said:
"Finally, the
NAE is catching up with the times by electing our
distinguished computer scientists. "
By "finally" I meant in the last few years. JMC, Jeff,
EAF, and Gene all should have been
elected several years ago.
-Nils
∂28-Feb-90 1405 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Forum sets record
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 14:05:10 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06956; Wed, 28 Feb 90 14:03:53 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA03830; Wed, 28 Feb 90 14:03:00 -0800
Date: Wed, 28 Feb 1990 14:02:59 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Forum sets record
Cc: tajnai@Hudson.Stanford.EDU
Message-Id: <CMM.0.88.636242579.tajnai@Hudson.Stanford.EDU>
Today is the end of our first six months into the fiscal year, and we
have brought in a record $1,023,396.
Because of the large number of visiting scholars and because of
the increase in the Forum membership fee, the $$ are up. However, we have
a net loss of 5 companies (and possibly one more).
Thank you for all your help during the annual meeting. The visitors get
quite excited about meeting our famous faculty.
Carolyn
∂28-Feb-90 1410 kirsten@isl.Stanford.EDU EE 370 Seminar - MATLAB
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 14:10:01 PST
Received: from isl.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 28 Feb 90 14:05:43 PST
Received: by isl.Stanford.EDU (4.1/4.7); Wed, 28 Feb 90 14:08:33 PST
Date: Wed, 28 Feb 90 14:08:33 PST
From: kirsten@isl.Stanford.EDU (Kirsten Goodell)
To: ee-faculty@sierra
Subject: EE 370 Seminar - MATLAB
Information Systems Laboratory
EE370 Seminar
Skilling 191, 4:15-5:15
THURSDAY, MARCH 1, 1990
MATLAB
by
Cleve Moler
The MathWorks
ABSTRACT
MATLAB is an interactive "matrix laboratory" for
tasks involving matrices, graphics and general
numeric computation. This talk will trace MATLAB's
development and demonstrate its application with
examples taken from data analysis, matrix factorization,
differential equations and animated graphics. A video
tape shows some advanced "visualization" features.
∂28-Feb-90 1504 ingrid@russell.Stanford.EDU Talk by Daniel Lehmann, Thursday, 1 March, 10:30 a.m.
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 15:03:58 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA17775; Wed, 28 Feb 90 14:32:11 PST
Date: Wed, 28 Feb 90 14:32:11 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9002282232.AA17775@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Talk by Daniel Lehmann, Thursday, 1 March, 10:30 a.m.
AIC SEMINAR
General Patterns in Nonmonotonic Reasoning
Daniel Lehmann
Hebrew University, Jerusalem
Thursday, 1 March, 10:30 a.m.
SRI International
Building E, Conference Room EK242
The talk will present recent results obtained in an effort to study
properties of nonmonotonic inference operations, in the style in which
Tarski and Gentzen studied consequence operations. The main question
addressed is: how can we characterize nonmonotonic inferences by
positive properties, or by what should we replace Tarski's monotony
assumption? The talk will show that there is a well-defined set of
properties that seem to be central to any discussion of nonmonotonic
inference operations and will discuss them in relation with existing
nonmonotonic systems. Prior knowledge of some of the existing
nonmonotonic reasoning systems may help (or confuse), but is not a
prerequisite.
-------
NOTE FOR VISITORS TO SRI:
Please arrive at least ten minutes early in order to sign in and be
shown to the conference room.
SRI is located at 333 Ravenswood Avenue in Menlo Park. Visitors may
park in the visitors lot in front of Building A (red brick building at
333 Ravenswood Ave., second driveway on the right, east of Laurel) or
in the conference parking area at the corner of Ravenswood and
Middlefield. The seminar room is in Building A. Visitors should sign
in at the reception desk in the Building A lobby.
IMPORTANT: Attendance is open, but visitors from certain countries
designated by the US government must make arrangements in advance. If
you have not already made such arrangements before your arrival,
admission to the seminar will be denied. If you believe you may be
from one of these countries and if you wish to make arrangements to
attend, please call Judith Burgess at (415) 859-5924.
∂28-Feb-90 1513 ingrid@russell.Stanford.EDU CSLI Calendar, 1 March, vol. 5:19
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Feb 90 15:13:27 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA17935; Wed, 28 Feb 90 14:44:15 PST
Date: Wed, 28 Feb 90 14:44:15 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9002282244.AA17935@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 1 March, vol. 5:19
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
1 March 1990 Stanford Vol. 5, No. 19
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 1 MARCH 1990
12:00 noon TINLunch
Cordura 100 Reading: Underspecification in Phonetics
by Patricia Keating
Discussion led by Bill Poser
(poser@csli.stanford.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Constructive Conceptual Analysis
Jens Allwood
Department of Linguistics
University of Goteborg, Sweden
Abstract below
CSLI ACTIVITIES FOR NEXT THURSDAY, 8 MARCH 1990
12:00 noon TINLunch
Cordura 100 Reading: Natural Language and Natural Selection
by Steven Pinker and Paul Bloom
Discussion led by Paul Kiparsky
(kiparsky@csli.stanford.edu)
Abstract below
____________
THIS WEEK'S CSLI SEMINAR
Constructive Conceptual Analysis
Jens Allwood
The talk presents a nonplatonic approach to "conceptual analysis."
Concepts are claimed to be functional (goal, purpose) related
structurings of information that are normatively modifiable. In the
talk, an outline is given of a method for constructive conceptual
determination developed in Allwood 1989. The method consists in the
combination of "a priori" guidelines for conceptual analysis with
various empirical methods for gathering relevant information. An
overview is given of both guidelines and methods.
The combination of guidelines and methods results in a type of concept
determination that combines a "semantic field" approach (the same
informational base, several expressions) with a "meaning potential"
approach (one expression, several determinations of meaning).
____________
NEXT WEEK'S TINLUNCH
Reading: Natural Language and Natural Selection
by Steven Pinker and Paul Bloom
Discussion led by Paul Kiparsky
Pinker and Bloom argue, contra Chomsky and Gould, that the evolution
of the human-language faculty can be explained by neo-Darwinian
natural selection. One issue at stake in this debate is to what
extent the design of language is arbitrary rather than derivable
from communicative/cognitive function.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
Interplay of Proof Theory and Constructivist
Ideology in the USSR, 1950-70
Grigori Mints
Institute of Cybernetics
Tallinn, Estonia
Thursday, 1 March, 3:45 p.m.
Cordura 100
The whole picture of the post-war development of mathematical logic in
the USSR was influenced by the birth and active development of the
Russian school of constructive mathematics. This talk will review
some results obtained then, but insufficiently known in the West, as
well as the influence of the ideology on topics of research, methods
of research, and the researchers themselves.
Note that this topic is different from the one announced before. Next
week: Jeff Pelletier on Mass Expressions.
____________
SYMBOLIC SYSTEMS FORUM
Time Points or Time Intervals?
Problems in Axiomatizing Common Sense
Pat Hayes
Xerox PARC and Department of Computer Science
(hayes.pa@xerox.com)
Thursday, 1 March, 4:15 p.m.
Building 60, Room 61G
When we think about time, do we think of it as consisting of a
sequence of clock-times, or as consisting of intervals of time during
which things happen? In trying to formalize these perspectives so
that we can make a machine imitate our thinking, we find that
apparently simple axioms have unforeseen, unintuitive consequences.
This talk is an informal review of the history of trying to get a
clear, consistent description of time, and the pitfalls we meet along
the way.
Next week: Susan Stucky, Institute for Research on Learning. Title:
The Radically Efficient Agent in Context.
____________
ANNUAL MEETING OF THE WEST COAST CONFERENCE
ON FORMAL LINGUISTICS
Stanford University
Friday, 2 March - Sunday, 4 March
The 9th Annual Meeting of the West Coast Conference on Formal
Linguistics (WCCFL) will be held at Stanford University, hosted by the
Department of Linguistics, and coordinated by Peter Sells.
WCCFL was founded at Stanford in 1982. This year, forty-two papers on
all aspects of formal linguistics will be presented. There will be
speakers from all over the U.S., Canada, and Western Europe, as well
as five speakers from the Stanford community. Meetings will be held
at CSLI during Friday, 2 March, and in Jordan Hall during Saturday and
Sunday, 3 and 4 March.
The schedule for the conference is readable online in
/user/wccfl/schedule; for registration information, and so on, please
send mail to wccfl@csli.stanford.edu (registration fees for the
Stanford community are $10 for students and $15 for nonstudents).
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Interactions between Language and
Cognition in Toddlers
Alison Gopnik
University of California, Berkeley
Wednesday, 7 March, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
∂28-Feb-90 1647 DAVIES@Warbucks.AI.SRI.COM plλλPLANLUNCH RETURNS! -- MARCH 7 -- WEDNESDAY -- Martha Pollack
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 28 Feb 90 16:47:21 PST
Date: Wed 28 Feb 90 16:39:08-PST
From: DAVIES@Warbucks.AI.SRI.COM (Todd Davies)
Subject: plλλPLANLUNCH RETURNS! -- MARCH 7 -- WEDNESDAY -- Martha Pollack
To: planlunch@Warbucks.AI.SRI.COM
Message-ID: <636251948.0.DAVIES@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
----------------------------------------------------------------------
INTRODUCING THE TILEWORLD:
EXPERIMENTALLY EVALUATING AGENT ARCHITECTURES
Martha E. Pollack (POLLACK@AI.SRI.COM)
Artificial Intelligence Center
SRI International
11:00 AM, WEDNESDAY, MARCH 7
SRI International, Building E, Room EJ228
I shall describe a system called Tileworld, which consists of a
simulated robot agent and a simulated environment which is both
dynamic and unpredictable. Both the agent and the environment are
highly parameterized, enabling one to control certain characteristics
of each. One can thus experimentally investigate the behavior of
various meta-level reasoning strategies by tuning the parameters of
the agent, and can assess the success of alternative strategies in
different environments by tuning the environmental parameters. A
central hypothesis is that the appropriateness of a particular
meta-level reasoning strategy will depend in large part upon the
characteristics of the environment in which the agent incorporating
that strategy is situated. I shall describe initial experiments using
Tileworld, which have been designed to evaluate a version of the
meta-level reasoning strategy proposed in some earlier research (Bratman,
Israel, and Pollack 1988). Work on the Tileworld system is being done
jointly with Marc Ringuette of CMU.
-------
∂01-Mar-90 0933 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU lower bound for FSA language inclusion...
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 09:33:21 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21213; Thu, 1 Mar 90 09:33:20 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16089; Thu, 1 Mar 90 09:31:47 -0800
Message-Id: <9003011731.AA16089@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1771; Thu, 01 Mar 90 11:32:08 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1735; Thu, 01 Mar 90 11:32:06 CST
Date: Thu, 1 Mar 90 11:25:57 CST
Reply-To: "Michael I. Schwartzbach" <mis%daimi.dk@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Michael I. Schwartzbach" <mis%daimi.dk@VM1.NoDak.EDU>
Subject: lower bound for FSA language inclusion...
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
What is the lower bound for language inclusion of deterministic
finite automata with n states?
Language equality can be tested in time O(n a(n)) (where a() is the
inverse Ackermann's) but algorithms for inclusion seem to be
O(n↑2). Is this in fact a lower bound?
--
Michael I. Schwartzbach / mis@daimi.dk (..uunet!mcvax!diku!daimi!mis)
Computer Science Department, Aarhus University
Ny Munkegade 116, DK-8000 Aarhus C, DENMARK
phone: +45 6 12 71 88 / telefax: +45 6 13 57 25 / telex: 64767 aausci dk
∂01-Mar-90 0933 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Looking for roommate during DMCC5 at Charleston, SC, April 9-12
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 09:33:38 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21233; Thu, 1 Mar 90 09:33:48 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16160; Thu, 1 Mar 90 09:34:05 -0800
Message-Id: <9003011734.AA16160@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1855; Thu, 01 Mar 90 11:32:41 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1793; Thu, 01 Mar 90 11:32:37 CST
Date: Thu, 1 Mar 90 11:27:01 CST
Reply-To: Ajay Gupta <gupta%cs.wmich.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ajay Gupta <gupta%cs.wmich.edu@VM1.NoDak.EDU>
Subject: Looking for roommate during DMCC5 at Charleston, SC, April 9-12
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am looking for a roommate during the Fifth Distributed Memory
Computing Conference at Charleston, SC from April 9 to 12, 1990.
If you are interested, please contact me at gupta@cs.wmich.edu
and/or (616) 387-5645.
Ajay Gupta
Dept. of Computer Science
Western Michigan University
Kalamazoo, MI 49008
∂01-Mar-90 0941 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU partition into isomorphic subgraphs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 09:41:14 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21747; Thu, 1 Mar 90 09:41:15 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16410; Thu, 1 Mar 90 09:40:04 -0800
Message-Id: <9003011740.AA16410@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1932; Thu, 01 Mar 90 11:36:52 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1907; Thu, 01 Mar 90 11:33:22 CST
Date: Thu, 1 Mar 90 11:27:19 CST
Reply-To: Sven Dickinson <sven%alv.umd.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Sven Dickinson <sven%alv.umd.edu@VM1.NoDak.EDU>
Subject: partition into isomorphic subgraphs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
There's a NP-complete problem in Garey & Johnson called "Partition
into Isomorphic Subgraphs." It states that given an instance (G,s)
where G and s are graphs, the decision problem as to whether or
not the graph G an be covered by one or more instances of graph s
(assuming no overlap) is NP-complete. The book goes on to state that
the decision problem is also NP-complete for an instance (G) where
s is a fixed graph of size >= 3.
My question is: Is the later problem also NP-complete for G and s
planar?
please send responses to sven@alv.umd.edu
Thanks,
Sven
∂01-Mar-90 0946 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Job Openings at Bell Labs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 09:45:57 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22086; Thu, 1 Mar 90 09:46:04 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16583; Thu, 1 Mar 90 09:46:15 -0800
Message-Id: <9003011746.AA16583@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2200; Thu, 01 Mar 90 11:42:29 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2155; Thu, 01 Mar 90 11:34:41 CST
Date: Thu, 1 Mar 90 11:31:09 CST
Reply-To: dsj%research.att.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: dsj%research.att.com@VM1.NoDak.EDU
Subject: Job Openings at Bell Labs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The AT&T Bell Laboratories Mathematical Sciences Research Center
currently has one or more permanent openings in theoretical computer science
for either junior or senior researchers.
Research areas in which we have a particular interest are
parallel and distributed computing, cryptography, algorithms and
data structures, combinatorial optimization, and graph theory and
combinatorics.
For more information, contact
Andrew Odlyzko, 201-582-7286, amo@research.att.com
David Johnson, 201-582-4742, dsj@research.att.com
Resumes should be sent to
David S. Johnson
Room 2D-150
AT&T Bell Laboratories
Murray Hill NJ 07974
(Those who have already applied for our Theoretical Computer Science
Post Docs, either to Joan Feigenbaum or David Johnson, need not
re-apply. You are already being considered for these new positions.)
∂01-Mar-90 0949 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU TCS Olympiad
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 09:48:57 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22447; Thu, 1 Mar 90 09:49:05 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16613; Thu, 1 Mar 90 09:46:40 -0800
Message-Id: <9003011746.AA16613@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2318; Thu, 01 Mar 90 11:43:22 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2295; Thu, 01 Mar 90 11:35:20 CST
Date: Thu, 1 Mar 90 11:31:29 CST
Reply-To: THEORYNT%YKTVMX.BITNET@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: THEORYNT%YKTVMX.BITNET@VM1.NoDak.EDU
Subject: TCS Olympiad
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Dear friends and collegues:
I propose to organise a Theoretical Computer Science Olympiad (henceforth
TCS Olympiad) around November 1990. The topics covered are
Graph Theory, Combinatorics, Mathematical Logic, Automata, Languages and
computation theory, Design and analysis of algorithms, formal development
of programs and correctness proofs(Dijkstra Gries Feijen Type problems
and solutions). Standard topics covered in an undergraduate curriculum
are sufficient to begin with. One can contemplate Olympiads at different
levels if there is sufficient response at various levels.
Comments, suggestions and volunteers are most welcome.
We have some models tried out informally which gave us some insight
and it turned to be positive and encouraging. My strong feeling is that
under TCS now we have enough mathematically matured and well defined
topics with lots of medium sized and clever problems created and
solved in the recent past. Such a competition would surely bring the
hidden potentials in the young TCS community to the limelight.
Also i wish to organise the same with participation from all over
the world with exam conducted in a distributed manner!!!.
The support from EACTCS and ACM etc will be sought after finalising
the details of the project.
My Address for hard mail:
DR.C.PANDU RANGAN, DEPT OF COMPUTER SCIENCE AND ENGENEERING,
INDIAN INSTITUTE OF TECHNOLOGY, MADRAS- 600 036, INDIA.
e-mail:: uunet!shakti!shiva!rangan
TELEX: 41-21062 IITM IN
I prefer hard mail as for as possible. If i receive a good responce
i shall periodically post on theory net the summary.
∂01-Mar-90 0959 stager@Sunburn.Stanford.EDU Courses and Degrees
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 09:59:12 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17028; Thu, 1 Mar 90 10:00:19 -0800
Date: Thu, 1 Mar 1990 10:00:17 GMT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU
Subject: Courses and Degrees
Message-Id: <CMM.0.88.636314417.stager@Sunburn.Stanford.EDU>
I'll be turning in our Courses and Degrees text tomorrow. Any changes you'd
like to make to the CS306, 323 or 350 course descriptions? (See Feb. 8
memo)
Please let me know.
Thanks.
Claire
∂01-Mar-90 1116 hemenway@Sunburn.Stanford.EDU Peterson's Guide
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 11:16:23 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18947; Thu, 1 Mar 90 11:17:21 -0800
Date: Thu, 1 Mar 1990 11:17:21 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: ac@Sunburn.Stanford.EDU
Subject: Peterson's Guide
Message-Id: <CMM.0.88.636319041.hemenway@Sunburn.Stanford.EDU>
This is just a reminder that I need to have all the changes for next
year's version of our Peterson's Guide entry by tomorrow. If you
haven't yet done so, I encourage you to look closely at your own
entry. The Graduate Admissions Office includes this sheet with every
application they send to prospective CS students so it is important
that the cryptic faculty research descriptions be up-to-date and
accurate. Thanks for your help.
Sharon
∂01-Mar-90 1227 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary of responses: EREW PRAMs vs NC↑1
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 12:26:57 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA03520; Thu, 1 Mar 90 12:26:38 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20978; Thu, 1 Mar 90 12:24:23 -0800
Message-Id: <9003012024.AA20978@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6304; Thu, 01 Mar 90 14:23:47 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6260; Thu, 01 Mar 90 14:23:43 CST
Date: Thu, 1 Mar 90 14:23:18 CST
Reply-To: Eric Allender <allender%cs.rutgers.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Eric Allender <allender%cs.rutgers.edu@VM1.NoDak.EDU>
Subject: Summary of responses: EREW PRAMs vs NC↑1
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Many thanks to those of you who responded with information concerning
EREW PRAMs and NC↑1.
Thanks especially to Paul Beame, Joan Lucas, and Vijaya Ramachandran,
who pointed out that any language in DLOG (deterministic log space) can
be recognized by an EREW PRAM in log time. Since NC↑1 is contained in
DLOG, and many people suspect that the containment is proper, it seems
unlikely that NC↑1 corresponds to log time on an EREW PRAM.
(Sketch of the simulation: use the "Euler Tour" method. The
configuration graph of a DLOG machine yields two trees: one
rooted at the ACCEPT state, and one rooted at the REJECT state.
Assign two processors to each edge in this graph -- one processor
for the "forward" direction, and one for the "backward" direction.
The processors can easily compute their predecessors and successors
in an Euler tour of their tree, starting at the root. Now use
pointer jumping to find which tree the start configuration is in.)
OPEN QUESTION: To whom can this be attributed?
Thanks also to Peter Clote and Ruediger Reischuk, for bringing to my attention
a paper by Klaus-Joern Lange in the upcoming Structure conference, in
which CREW-PRAM time is characterized in terms of "unambiguous" circuits.
- Eric Allender
∂01-Mar-90 1317 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 13:17:20 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06908; Thu, 1 Mar 90 13:17:16 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22082; Thu, 1 Mar 90 13:17:12 -0800
Message-Id: <9003012117.AA22082@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1327; Thu, 01 Mar 90 15:16:26 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1273; Thu, 01 Mar 90 15:16:23 CST
Date: Thu, 1 Mar 90 15:16:01 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
"William J. Joel" <JZEM@MARIST.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: "William J. Joel" <JZEM%MARIST.BITNET@VM1.NoDak.EDU>
Subject: GRG Seminar Series
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Graphics Research Group Seminar Series
======================================
Title Simulation versus Physically Based Modeling
Speaker William J. Joel
Marist College
Date Thursday, March 22, 1990
Time 9:50 - 11:10 am
Room LT005
Abstract The need for computer animators to produce animations
using as little CPU time as possible often convinces
the animator to use a simulation instead of a true
physically based model. This talk will explore some
simple examples as well as discuss current work being
performed by other researchers.
+--------------------------------------------------------------------------+
+ The past is but the beginning of a beginning, and all that is +
+ and has been is but the twilight of the dawn. +
+ (The Discovery of the Future, H.G. Wells) +
+--------------------------------------------------------------------------+
Bill Joel
jzem@marist.bitnet
∂01-Mar-90 1334 csl@sierra.Stanford.EDU Computer Systems Laboratory Special Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 13:34:38 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Thu, 1 Mar 90 13:28:25 PST
Date: Thu, 1 Mar 90 13:28:25 PST
From: csl@sierra.Stanford.EDU (Eileen Schwappach)
To: ee-administration@sierra.Stanford.EDU, ee-faculty@sierra.Stanford.EDU,
cis@glacier, csd@sunburn, su-events@score,
csl-everyone@sierra.Stanford.EDU
Cc: csl@sierra.Stanford.EDU
Subject: Computer Systems Laboratory Special Seminar
Message-Id: <CMM.0.88.636326904.csl@>
SPECIAL COMPUTER SYSTEMS LABORATORY SEMINAR
MONDAY, MARCH 5TH, 1990
9:30 TO 11:00 AM
CENTER FOR INTEGRATED SYSTEMS, ROOM 101
SCHEDULING SUPPORT FOR CONCURRENCY AND PARALLELISM
IN THE MACH OPERATING SYSTEM
David L. Black
School of Computer Science
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213
(412) 268-3041
david.black@cs.cmu.edu
ABSTRACT
Changes in the use of multiprocessors are placing new demands on
operating system schedulers. This seminar describes some of the new
challenges posed by parallel and concurrent applications, and
introduces techniques developed by the Mach project to meet these
challenges. An overview of the techniques of timesharing scheduling
and a description of the Mach scheduler are also included.
This seminar describes work to incorporate processor allocation
and control into the Mach operating system. The design approach
divides the implementation into three components:
1. Basic mechanisms implemented in the kernel.
2. Long term policy implemented in a server.
3. Optional user implementation of short term policy.
Isolating long-term policy in a server yields the advantages of
policy-mechanism separation, while avoiding the drawbacks encountered
in previous applications of this principle to multiprocessor
scheduling. The design and implementation of a processor allocation
server for a gang scheduling policy is also described.
This seminar also describes work to support the effective
multiprogrammed use of multiprocessors. The approach taken to this
problem implements the scheduler in the kernel, but encourages users to
provide hints. This allows the scheduler to take advantage of user
knowledge without requiring users to implement sophisticated scheduling
modules.
∂01-Mar-90 1343 hall@cis.Stanford.EDU SPECIAL SEMINAR
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 13:42:47 PST
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Thu, 1 Mar 90 13:37:09 PST
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA16607; Thu, 1 Mar 90 13:36:59 PST
Message-Id: <9003012136.AA16607@cis.Stanford.EDU>
To: iclabusers@glacier.Stanford.EDU, cis-people@glacier.Stanford.EDU
To: ee-faculty@sierra.Stanford.EDU
Subject: SPECIAL SEMINAR
Date: Thu, 01 Mar 90 13:36:56 PST
From: hall@cis.Stanford.EDU
****************
* Seminar *
******************** ANNOUNCEMENT ******************
11:00 AM, Monday, March 5, 1990
CIS 101
A 1024-ELEMENT HIGH-PERFORMANCE SILICON TACTILE IMAGER
Khalil Najafi
Center for Integrated Sensors and Circuits
Department of Electrical Engineering and Computer Science
University of Michigan
Ann Arbor, MI
This talk will present the design, fabriction, and testing of a
32x32-element capacitive silicon tactile imager developed for use
in precision robotics applications where high density and high
resolution are important. The imager utilizes a novel doubly-
supported bridge structure as a force transducer and offers high
density, high resolution, and high stability in a simple high-yield
fabrication process. The silicon chip measures 1.6cmx1.6cm and is
organized in an X-Y matrix of 1024 capacitor elements on 0.5mm centers.
The process uses two boron diffusions (deep and shallow) followed by
a silicon-to-glass electrostatic bonding step and subsequent unmasked
wafer dissolution. A measured force sensitivity of 0.27 pF/gmf/element,
temperature sensitivity of less than 30 ppm/degrees C, and maximum
operating force of approximately 1gm/element have been obtained.
A discrete data acquisition system used with the device offers over
6 bits of force resolution and the imager can be read at a rate of
15-20 microsec/element, offering an effective frame rate of 5.1msec.
****************************
∂01-Mar-90 1413 chandler@Sunburn.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 14:13:30 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA24659; Thu, 1 Mar 90 14:13:08 -0800
Date: Thu, 1 Mar 1990 14:13:07 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Publication
Message-Id: <CMM.0.88.636329587.chandler@Sunburn.Stanford.EDU>
I have just received a publication from ONR entitled FY89 Program Summary
Book. This book provides detailed technical descriptions of essentially all
computer science basic research efforts supported by ONR. This is a huge
publication...over 700 pages. I will be glad to put it "on loan" to you if
you are interested in seeing it.
∂01-Mar-90 1525 hemenway@Sunburn.Stanford.EDU Meeting will be at 1:00 pm
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 15:24:59 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26453; Thu, 1 Mar 90 15:25:47 -0800
Date: Thu, 1 Mar 1990 15:25:44 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Meeting will be at 1:00 pm
Message-Id: <CMM.0.88.636333944.hemenway@Sunburn.Stanford.EDU>
Having heard no violent objections, we will go ahead with the new
start time of 1:00 pm this Sunday.
See you all then.
Sharon
P.S. I'm afraid that I can't commit to being able to provide our
usual munchies for this meeting so if anyone would care to bring
in something good to chew on, it would be much appreciated (and
reimbursed for on Monday)!
∂01-Mar-90 1832 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Mar 90 18:32:13 PST
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA11070; Thu, 1 Mar 90 18:25:46 PST
Date: Thu 1 Mar 90 18:25:45-PST
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <636344745.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, March 8, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Susan U. Stucky, Institute for Research on Learning
Topic: "The Radically Efficient Agent in Context"
ABSTRACT
--------
If we take mind to be made up of (in part) dynamic
internal states with content, that is if we take cognitive
states to be about things outside those states, and if we
admit that some of these cognitive states have indexical
content, then we arrive at a fundamental question: what is
the relation between the content of language as externally
expressed, and its corresponding internal state?
In this talk, I will put forward a candidate null
hypothesis to the effect that the expressions of language
and their corresponding internal states are equivalently
indexical. This hypothesis claims at once that the
contribution of language to natural language understanding
is perhaps less than we once thought. And it suggests that
the appropriate data for a theory of this sort is the stuff
of ordinary conversation full of the misunderstanding,
vagueness, and ambiguity that seems to pervade it. In the
talk, I will argue for the radical efficiency hypothesis,
lay out the beginnings of an investigation of its validity,
and discuss relevant examples.
-------
∂01-Mar-90 2018 LOGMTC-mailer Parikh talk on knowledge
Received: from coraki.stanford.edu by SAIL.Stanford.EDU with TCP; 1 Mar 90 20:18:26 PST
Received: by coraki.stanford.edu (4.0/25-eef) id AA15599; Thu, 1 Mar 90 20:19:19 PST
Date: Thu, 1 Mar 90 20:19:19 PST
From: Vaughan Pratt <pratt@cs.stanford.edu>
Message-Id: <9003020419.AA15599@coraki.stanford.edu>
To: logmtc@sail
Subject: Parikh talk on knowledge
Reasoning about Knowledge
A Survey of Recent Results
Prof. Rohit Parikh, CUNY
4:15 pm, Thursday, March 8
MJ 301
Abstract
It is clear by now that we have now a new interdisciplinary area
invloving people interested in Distributed Computing, AI, Mathematical
Economics and Linguistics, who look to the notion of Knowledge to
formalise important issues in their fields. Time will tell whether
they will be disappointed, but the indications, at least for now, seem
to be positive.
We will discuss recent developments and continuing work and speculate
about the future of the field. The talk will overlap but not coincide
with the tutorial at Asilomar.
Host: Prof. Vaughan Pratt
∂02-Mar-90 0002 LOGMTC-mailer tuesday seminar
Received: from Vashti.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Mar 90 00:02:06 PST
Received: by Vashti.Stanford.EDU (5.61/25-eef) id AA01615; Thu, 1 Mar 90 23:56:22 -0800
Date: Thu, 1 Mar 90 23:56:22 -0800
From: Dinesh Katiyar <katiyar@Vashti.Stanford.EDU>
Message-Id: <9003020756.AA01615@Vashti.Stanford.EDU>
To: logmtc@sail.stanford.edu
Subject: tuesday seminar
----------------------------------------------------------------------
tuesday seminar
4:15 pm, march 6
mjh 301
----------------------------------------------------------------------
Theorem Proving in Intuitionistic Logic
Natarajan Shankar
Abstract:
Intuitionistic theorem proving is harder than classical theorem proving
(for humans and machines) and has useful applications in logic
programming, type theory, and program synthesis. A procedure for
searching for proofs in the intuitionistic sequent calculus will be
derived, starting from the Herbrand theorem for classical sequent
calculus. The procedure uses an extended notion of Herbrand functions
to encode the impermutabilities inherent in intuitionistic sequent
calculi proofs. As an application, the Herbrand theorem for
hereditarily Harrop formulas will be derived. Some implementational
details will also be discussed. The only background needed will be an
understanding of the syntax and semantics of first-order logic.
----------------------------------------------------------------------
∂02-Mar-90 0924 hemenway@Sunburn.Stanford.EDU IMPORTANT -- Getting Ratings to Me
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Mar 90 09:24:05 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08193; Fri, 2 Mar 90 09:24:49 -0800
Date: Fri, 2 Mar 1990 9:24:48 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: IMPORTANT -- Getting Ratings to Me
Message-Id: <CMM.0.88.636398688.hemenway@Sunburn.Stanford.EDU>
In order to incorporate as many ratings as possible into the reports
for Sunday's meeting, I would much appreciate you trying to abide
by these guidelines as much as possible...
Thursday (yesterday) pick-ups: Please try to get me your rating
sheets as early as possible today. That way, Aleta and I can
be up-to-date when we proofread ratings this afternoon (when
entering 900 or so numbers, I'm bound to make a mistake somewhere!).
Friday pick-ups: I will plan on coming in around 2:00 tomorrow
(Saturday) afternoon so, if at all possible, please try to get
me your ratings by then. You can either put them in the pick-up
box, slip them under my door or put them in my mailbox up by the
front desk. I will be running the reports for the meeting
Saturday afternoon (4:00ish?) so any ratings received after that
will most likely not be included.
Saturday pick-ups: As we discussed at the Round 1 meeting, these
ratings will (most likely) not be included in the reports. I
will, however, be getting here around 11:30 or 12 on Sunday morning
SO, if you can get me the ratings by then, I will try to incorporate
them and re-run the reports (I can't promise that everything will
fall into place that neatly though).
Thanks for your help. Have a nice weekend (?).
Sharon
∂02-Mar-90 1053 kirsten@isl.Stanford.EDU EE 370 Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Mar 90 10:53:34 PST
Received: from isl.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Fri, 2 Mar 90 10:47:54 PST
Received: by isl.Stanford.EDU (4.1/4.7); Fri, 2 Mar 90 10:50:42 PST
Date: Fri, 2 Mar 90 10:50:42 PST
From: kirsten@isl.Stanford.EDU (Kirsten Goodell)
To: ee-faculty@sierra, isl-faculty@isl.Stanford.EDU, msgs@isl.Stanford.EDU
Subject: EE 370 Seminar
Cc: bert@kaos, buneman@sierra, cottle@sierra, golub@na-net, harriet@star,
mike@sol-michael, milletti@isi.com, miraflor@sierra, moler@na-net,
na.cem@forsythe, oliger@pride, veinott@sierra
Information Systems Laboratory
EE370 Seminar
Skilling 191, 4:15-5:15 PM
THURSDAY, MARCH 8, 1990
Micromachining the Future
by
Dr. Marc Madou
Teknekron Sensor Development Corporation
ABSTRACT
All types of active electronic devices and microprocessors in a
process control loop are already manufactured from Si in a batch type
of process. Recent developments in the micromachining arena enable
one to also batch fabricate sensors, power sources, and actuator parts
in Si or other materials (e.g. polymers and ceramics).
This seminar is intended to illustrate these recent developments in
micromachining, indicating how bulky analytical equipment is being
replaced by microsensors and how micromachined parts, in general, will
lead to distributed sensing, power and actuating.
The advent of distributed sensing, power, and actuating, in turn, will
require novel means of signal processing and communication. Some
early examples on how this impact is already being felt in some fields
will be given.
∂02-Mar-90 1220 LOGMTC-mailer Mints seminar series
To: LOGMTC@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Speaker: Grigori Mints, Institute of Cybernetics, Tallinn 200108, Estonia
Title: Complexity of Subclasses of the Intuitionistic Propositional Calculus
Time: Noon, Wednesday March 7, 1990
Place: 352 Margaret Jacks Hall (Stanford Computer Science)
Abstract:
The decision problem for the intuitionistic propositional
calculus (IPC) is known to be P-space complete. We investigate
the complexity of the decision problem for subclasses of IPC
determined by syntactic restrictions, and present upper bounds
for decision procedures locating these subclasses into lower
complexity classes.
∂02-Mar-90 1329 chandler@Sunburn.Stanford.EDU Next Tuesday's Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Mar 90 13:29:44 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14758; Fri, 2 Mar 90 13:29:54 -0800
Date: Fri, 2 Mar 1990 13:29:52 GMT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Next Tuesday's Faculty Lunch
Message-Id: <CMM.0.88.636413392.chandler@Sunburn.Stanford.EDU>
Please be sure that your calendars are marked for next Tuesday's faculty
lunch. There is no formal topic ... CSD's 25th anniversary celebration may
be discussed.
∂02-Mar-90 1447 eisensee@sierra.Stanford.EDU Courses and Degrees
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Mar 90 14:47:16 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Fri, 2 Mar 90 14:42:31 PST
Date: Fri, 2 Mar 90 14:42:31 PST
From: eisensee@sierra.Stanford.EDU (Sandra K. Eisensee)
To: ee-faculty@sierra
Cc: eisensee@sierra.Stanford.EDU
Subject: Courses and Degrees
Message-Id: <CMM.0.88.636417749.eisensee@>
The documentation for the 1990-91 Courses and Degrees is ready for
inspection. Please come by McC 204 by March 6th to initial it or
make any changes.
Fabian
∂03-Mar-90 1122 LOGMTC-mailer Logic/Database Talk
Received: from linz.stanford.edu by SAIL.Stanford.EDU with TCP; 3 Mar 90 11:22:34 PST
Received: by linz.stanford.edu (5.59/25-eef) id AA01340; Sat, 3 Mar 90 11:24:04 PDT
Message-Id: <9003031924.AA01340@linz.stanford.edu>
To: logmtc@sail
Subject: Logic/Database Talk
Reply-To: tah@cs.stanford.edu
Date: 03 Mar 90 11:24:02 PST (Sat)
From: Tom Henzinger <tah@linz>
Dr. Jean-Louis Lassez (IBM Yorktown):
QUERYING CONSTRAINTS
Friday, March 9
12:15 pm, MJH 301
∂03-Mar-90 1314 LOGMTC-mailer special seminar
To: logmtc@SAIL.Stanford.EDU
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Noon, Tuesday March 6
301 Margaret Jacks
A Backwards Analysis for Compile-time Garbage Collection
Torben Mogensen
DIKU -- Computer Science Department, University of Copenhagen, Denmark
We describe a context analysis that computes the exact number of uses of
the value of an expression [in a lambda-calculus based language]. This
uses information about the actual value, obtained from the standard
semantics of the language. The standard semantics is then abstracted away
to yield an approximating analysis. The results can be used to find
places where storage cells can be safely overwritten.
∂05-Mar-90 0642 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Reductions from problems to MIS, VC or Max. clique (info request)
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 06:42:41 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12993; Mon, 5 Mar 90 06:42:59 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11523; Mon, 5 Mar 90 06:42:56 -0800
Message-Id: <9003051442.AA11523@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4631; Mon, 05 Mar 90 08:42:58 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4613; Mon, 05 Mar 90 08:42:54 CST
Date: Mon, 5 Mar 90 08:38:44 CST
Reply-To: Arun Jagota <jagota%cs.buffalo.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Arun Jagota <jagota%cs.buffalo.edu@VM1.NoDak.EDU>
Subject: Reductions from problems to MIS, VC or Max. clique (info request)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I would like to request references (or details if feasible) on
reductions FROM other problems (any and all) TO Maximum Independent
Set, Minimum cover or Maximum clique.
My interest is limited to reductions in which the representation is
explicitly shown (like the representation of 3-SAT in Vertex cover
in Gary & Johnson).
Indirect reductions (ie transitive closure) of such reductions is
fine too, as long as all the representations are made explicit along
the way.
Please reply to me, directly by "e-mail", unless you think an answer to
this request is of general interest. I will compile all the information
I receive. Also to request any information that I've collected, send me
e-mail. I prefer not clogging the net with information that may not have
wide interest.
Thanking you,
Arun Jagota
jagota@cs.buffalo.edu
∂05-Mar-90 0647 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Hamiltonian circuits in complements of line graphs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 06:47:08 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13033; Mon, 5 Mar 90 06:47:21 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11544; Mon, 5 Mar 90 06:46:16 -0800
Message-Id: <9003051446.AA11544@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4735; Mon, 05 Mar 90 08:44:50 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4705; Mon, 05 Mar 90 08:44:08 CST
Date: Mon, 5 Mar 90 08:40:40 CST
Reply-To: Marko.Petkovsek%B.GP.CS.CMU.EDU@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Marko.Petkovsek%B.GP.CS.CMU.EDU@VM1.NoDak.EDU
Subject: Hamiltonian circuits in complements of line graphs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I know that the Hamiltonian circuit problem is NP-complete for line
graphs. How about COMPLEMENTS of line graphs? A nice equivalent formulation
of this problem is the following:
INSTANCE: Undirected graph G = (V,E).
QUESTION: Is there a cyclic ordering of E in which any two consecutive
edges have no vertex in common?
I would appreciate any information (or pointers to information) about the
complexity of this problem. I couldn't find it in either Garey, Johnson's
"Computers and Intractability" or in D.S. Johnson's NP-completeness columns
in Journal of Algorithms.
Marko.Petkovsek@cs.cmu.edu
∂05-Mar-90 0647 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU geometry problem
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 06:47:33 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13038; Mon, 5 Mar 90 06:47:36 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11547; Mon, 5 Mar 90 06:47:32 -0800
Message-Id: <9003051447.AA11547@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4808; Mon, 05 Mar 90 08:47:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4785; Mon, 05 Mar 90 08:44:37 CST
Date: Mon, 5 Mar 90 08:40:56 CST
Reply-To: Richard Schroeppel <rcs%la.tis.com@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Richard Schroeppel <rcs%la.tis.com@VM1.NoDak.EDU>
Subject: geometry problem
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Suppose you have a planar polygon, not necessarily convex.
The interior face of each edge is a mirror.
A candle is lighted at some interior point. The light spreads
out, reflects off the mirror edges and spreads further, etc.
Is any place inside the polygon completely dark?
Rich Schroeppel
rcs@la.tis.com
∂05-Mar-90 0900 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report column, Feb. 28,
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 09:00:38 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15696; Mon, 5 Mar 90 09:00:22 -0800
Date: Mon, 5 Mar 1990 9:00:22 GMT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@sunburn.Stanford.EDU
Subject: [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report column, Feb. 28,
1990 ]
Message-Id: <CMM.0.88.636656422.bergman@Sunburn.Stanford.EDU>
FYI.
-Sharon Bergman
---------------
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
National Science Foundation Postdoctoral Research Associateships in
Computational Science
The New Technologies program in the Division of Advanced Scientific
Computing will provide support for Postdoctoral Research
Associateships in Computational Science. Normally, awards will
provide support through a standard grant for 24 months. Awards will
range from $32,000 to $40,000 over the 24-month period, to be
matched equally by the sponsoring institution. Deadline: April 1,
1990.
∂05-Mar-90 0922 LOGMTC-mailer Lectures on Linear Logic
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 09:22:52 PST
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA15463; Mon, 5 Mar 90 09:24:37 PST
Date: Mon, 5 Mar 90 09:24:37 PST
From: andre@csli.Stanford.EDU (Andre Scedrov)
Message-Id: <9003051724.AA15463@csli.Stanford.EDU>
To: barwise@russell.stanford.edu, etch@russell.stanford.edu,
logmtc@sail.stanford.edu, poly@ghoti.stanford.edu
Subject: Lectures on Linear Logic
In the remaining four lectures in CS 359 I will give an introduction
to linear logic. The class meets T Th 9:30 - 10:45 in Building 60,
room 62.
Andre Scedrov
∂05-Mar-90 0952 hemenway@Sunburn.Stanford.EDU Final List Confirmation
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 09:52:11 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17525; Mon, 5 Mar 90 09:52:38 -0800
Date: Mon, 5 Mar 1990 9:52:36 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Final List Confirmation
Message-Id: <CMM.0.88.636659556.hemenway@Sunburn.Stanford.EDU>
There was enough confusion at the end of yesterday's meeting (moving
people from the admitted to the wait list) that I want to confirm
that I have the correct info. I show 43 people from the original list
admitted -- that is, the top 41 excepting Tamaki, and then Hoang,
Handley (white-ball from Vaughan) and Gunopulos. With Dan Pehoushek
(John McCarthy's whiteball) and David Karger (the deferral from
last year), we have a total of 45. There are 6 people on the
wait list: Hardwick, Bishop, Sengers, Stanley, Moreira and Ringrose,
in that order.
Here's the full list (not including Pehoushek and Karger): [Please let
me know right away if you think I'm mistaken in anything!]
Agesen, Ole AARHUS UNIVERSITY PSL NDS
Arora, Sanjeev MIT MTC AA
Buvac, Sasa HARVARD UNIVERSITY AI AA
Capoyleas, Vasilis UNIVERSITY OF LONDON AA
Cheshire, Stuart UNIVERSITY OF CAMBRIDGE CG NDS
Costello, Tom TRINITY COLLEGE (Dublin) DCS AI
Dabija, Vlad POLITECHNIC INST OF BUCHAREST AI CL
De Marcken, Carl MIT CL NA
Drakopoulos, John UNIVERSITY OF CRETE AI AA
Eisner, Jason HARVARD UNIVERSITY AI CL
Feldman, Todd STANFORD UNIVERSITY MTC AA
Flournoy, Raymond HARVARD UNIVERSITY CL AI
French, Robert MIT NDS PSL
Ghahramani, Zoubin UNIVERSITY OF PENNSYLVANIA AI CL
Govil, Manoj IIT, KANPUR AA MTC
Gunopulos, Dimitrios UNIVERSITY OF PATRAS MTC AA
Handley, Simon UNIVERSITY OF AUCKLAND CG PSL
Harchol, Mor BRANDEIS UNIVERSITY AI AA
Heng, Wee-Liang UC, BERKELEY AA CM
Ho, Chian-Min UNIV OF MANCHESTER AI DCS
Hoang, My WELLESLEY COLLEGE AA OR
Kades, Eric YALE UNIVERSITY NDS PSL
Lent, Arthur MIT MTC PSL
Lim, Amy MIT DCS AA
Magerman, David UNIVERSITY OF PENNSYLVANIA CL AI
McDonald, Jim MICHIGAN STATE UNIVERSITY AI MTC
Murphy, Brian MIT PSL AA
Ramkumar, GDS IIT, MADRAS AA MTC
Shyam, Bharat IIT, BOMBAY NDS OS
Siapas, Athanassios MIT MTC AA
Slonim, Donna YALE UNIVERSITY AA NDS
Spertus, Ellen MIT DCS PSL
Srinivas, Sampath IIT, MADRAS AI DA
Steiglitz, Mark CORNELL UNIVERSITY NDS OS
Stichnoth, James UNIV OF ILLINOIS OS PSL
Thornley, John UNIVERSITY OF AUCKLAND PSL OS
Torrie, Evan UNIVERSITY OF AUCKLAND DCS PSL
V., Ramesh IIT, KANPUR MTC AA
Vo, Minh UNIVERSITY OF WATERLOO AI ROB
Wallach, Deborah MIT DCS NDS
Wang, Michelle HARVARD UNIVERSITY CL AI
Wvong, Russil UNIVERSITY OF BRITISH COLUMBIA AA NDS
Yan, Thomas CORNELL UNIVERSITY PSL
P.S. We had Ramesh V.'s name wrong. His *last* name is V.
∂05-Mar-90 1116 @Sunburn.Stanford.EDU:nowick@Neon.Stanford.EDU Re: Final List Confirmation
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 11:16:09 PST
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22029; Mon, 5 Mar 90 11:16:42 -0800
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA22443; Mon, 5 Mar 90 11:16:33 -0800
Date: Mon, 5 Mar 1990 11:16:32 PST
From: "Steven M. Nowick" <nowick@Neon.Stanford.EDU>
To: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
Cc: phd-adm@sunburn.Stanford.EDU, nowick@Neon.Stanford.EDU
Subject: Re: Final List Confirmation
In-Reply-To: Your message of Mon, 5 Mar 1990 9:52:36 GMT
Message-Id: <CMM.0.88.636664592.nowick@Neon.Stanford.EDU>
I thought that we decided not to admit Karger again (the deferred
admittee) -- I could be wrong.
Steve
∂05-Mar-90 1133 @Sunburn.Stanford.EDU:RPG@SAIL.Stanford.EDU re: Final List Confirmation
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 11:33:15 PST
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22610; Mon, 5 Mar 90 11:33:48 -0800
Message-Id: <185p9A@SAIL.Stanford.EDU>
Date: 05 Mar 90 1132 PST
From: Dick Gabriel <RPG@SAIL.Stanford.EDU>
Subject: re: Final List Confirmation
To: nowick@Neon.Stanford.EDU, hemenway@Sunburn.Stanford.EDU
Cc: phd-adm@Sunburn.Stanford.EDU
[In reply to message from nowick@Neon.Stanford.EDU sent Mon, 5 Mar 1990 11:16:32 PST.]
That was Paxton (?) who was not a deferral but a reconsider after turning
us down and having things ``not work out'' at Cornell.
-rpg-
∂05-Mar-90 1143 @RELAY.CS.NET:mazzetti@ed.aaai.org video
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 5 Mar 90 11:43:00 PST
Received: from relay2.cs.net by RELAY.CS.NET id ae28960; 5 Mar 90 13:19 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa03897; 5 Mar 90 14:14 EST
Received: from nilsson.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA04182; Mon, 5 Mar 90 09:59:20 PST
Received: by nilsson.aaai.org (3.2/AAAI-SMI-3.2)
id AA08532; Mon, 5 Mar 90 10:05:55 PST
Date: Mon, 5 Mar 90 10:05:55 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9003051805.AA08532@nilsson.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Hayes-Roth@SUMEX-AIM.STANFORD.EDU,
Hinton@RI.CMU.EDU, JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Nilsson@score.stanford.edu, RGSmith@SLCS.SLB.COM, Rich@MCC.COM,
bobrow@XEROX.COM, buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM,
duda%polya@score.stanford.edu, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU
Subject: video
Cc: jmc@SAIL.STANFORD.EDU, mazzetti@nilsson, minksy@ai.mit.edu,
newell@CS.CMU.EDU, simon@CS.CMU.EDU, woody@CS.UTEXAS.EDU
Because there has been considerable disagreement about producing a
history of AI video, DEC and I have decided to cancel the video
project because there is not enough time to produce the scholarly
treatment of AI history.
DEC still wants to do a video project. I've asked them to submit a
proposal to us describing our potential role. The content of this
video is still yet to be determined.
Claudia
∂05-Mar-90 1301 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU AFLB this week
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 12:51:27 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28418; Mon, 5 Mar 90 12:47:48 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-eef) id AA17795; Mon, 5 Mar 90 12:47:17 -0800
Message-Id: <9003052047.AA17795@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: AFLB this week
Date: Mon, 05 Mar 90 12:47:14 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
This week's AFLB will be at the usual time and place
(Thursday, 12:00pm, MJH 252).
Speaker: Moni Naor, IBM Almaden Research Center
Title:
Public-key cryptosystems provably secure against chosen ciphertext attack
Abstract:
In a public-key cryptosystem, any user can easily encrypt messages but,
if the cryptosystem is secure, cannot decrypt messages without access
to the decryption device.
A chosen ciphertext attack on a cryptosystem consists of a preliminary
stage, where the attacker is allowed to encrypt any message she wants
and is allowed to use the decryption device as a black box to decrypt any
message she wants. Afterward, the attack is considered successful if
she is able to decrypt subsequent messages without the help of the decryption
device.
We show how to use a non-interactive zero-knowledge proof system to convert
any public-key cryptosystem into one that is secure against a
chosen ciphertext attack.
Blum, Feldman and Micali introduced non-interactive zero-knowledge proof
systems for language membership. Such a system allows users who share a
random string to prove membership in a language non-interactively
(i.e. by sending a single message), without revealing any other useful
information.
Using a non-interactive proof system suggested by De Santis, Micali and
Persiano this yields a concrete implementation of a public-key cryptosystem
secure agains chosen ciphertext attack based on the quadratic residousity
assumption.
This is joint work with Moti Yung.
∂05-Mar-90 1330 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: Final List Confirmation
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 13:30:17 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26064; Mon, 5 Mar 90 13:30:49 -0800
Received: by Hudson.Stanford.EDU (5.61/25-eef) id AA27022; Mon, 5 Mar 90 13:30:12 -0800
Date: Mon, 5 Mar 1990 13:30:11 PST
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
Cc: phd-adm@Sunburn.Stanford.EDU
Subject: Re: Final List Confirmation
In-Reply-To: Your message of Mon, 5 Mar 1990 9:52:36 GMT
Message-Id: <CMM.0.88.636672611.ango@Hudson.Stanford.EDU>
To PhD admissions committee members:
I am quite disappointed to find out that My Hoang, who was in the bottom
in my rating, ended up being accepted. Normally I would not argue
with what I consider to be a mistake of an admissions committee, but in this
case I would like to try, since the candidate has interest in my research
area and therefore I am more qualified to make a judgment and more
concerned about the consequences of admitting a weak student.
Since I was not at this Sunday meeting, I'd like to present my arguments
against the case. These arguments are as follows:
1. 36% in Computer Science GRE is EXTREMELY low, even if one factors in
all the drawbacks of the test.
2. Applicant's coursework in the major fields (math and CS) is fairly weak.
For example, it contains no classes in computer architecture, compilers,
and programming languages.
3. Although Wellesley offers very good courses in many fields, CS and Math
are not among them. However, Wellesley has an exchange program with
MIT, and motivated Wellesley students can get excellent education by
taking advantage of it. The applicant have not done so.
4. In the spirit of 3, it does not seem that the Math and CS courses
offered at Wellesley are very competitive, so good grades obtained
in these courses do not mean as much as good grades obtained in a more
competitive environment.
To summarize, the applicant does not appear to have a strong enough
background in CS or a related field. Given the background that is
inferior to that of most Round 2 applicants, only a well-demonstrated
ability to do research can justify the admission. Although the applicant
may have a potential to do research, I do not see a proof of such a
potential.
Admitting an applicant against these reservations is unfair to those
applicants we rejected, since many of them look better, and to the theory
group, which will be stuck with potentially problematic case.
I urge the committee to reconsider the decision in this case.
--Andrew Goldberg
∂05-Mar-90 1407 @Sunburn.Stanford.EDU:dill@amadeus.Stanford.EDU Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 14:07:11 PST
Received: from Amadeus.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27539; Mon, 5 Mar 90 14:07:33 -0800
Received: by amadeus.Stanford.EDU (5.57/Ultrix2.4-C)
id AA13307; Mon, 5 Mar 90 14:09:49 PST
Date: Mon, 5 Mar 90 14:09:49 PST
From: dill@amadeus.Stanford.EDU (David Dill)
Message-Id: <9003052209.AA13307@amadeus.Stanford.EDU>
To: phd-adm@sunburn.Stanford.EDU
Subject: Hoang
I have much less excuse to complain about this than Andy,
since I was actually at the meeting. However, I must have
forgotten who she was by the time we dealt with the "+" people
at the end. I think Hardwick, Bishop, and Stanley (on waitlist)
are all stronger. Ringrose and Moreira probably are, too, but
we didn't really have time to consider their applications carefully.
However, if it is too late to be debating this, I imagine we can
live with it.
Dave
∂05-Mar-90 1413 hemenway@Sunburn.Stanford.EDU Re: Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 14:13:32 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA28046; Mon, 5 Mar 90 14:14:04 -0800
Date: Mon, 5 Mar 1990 14:14:02 GMT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: dill@amadeus.Stanford.EDU (David Dill)
Cc: phd-adm@sunburn.Stanford.EDU
Subject: Re: Hoang
In-Reply-To: Your message of Mon, 5 Mar 90 14:09:49 PST
Message-Id: <CMM.0.88.636675242.hemenway@Sunburn.Stanford.EDU>
Let me add that I have already sent over admission notices to Grad.
Admissions for everyone we admitted at the meeting (except Hoang who
I held back only with reluctance). We're committed to them at least.
Sharon
∂05-Mar-90 1521 LOGMTC-mailer Re: MSRI Seminar Announcements, Feb 19-23
Received: from msri.org (euclid.msri.org) by SAIL.Stanford.EDU with TCP; 5 Mar 90 15:21:03 PST
Received: by msri.org (AIX 2.1.2/s2.2)
id AA05037; Mon, 5 Mar 90 15:08:49 PST
Received: from ames.arc.nasa.gov by apple.com with SMTP (5.61/25-eef)
id AA24860; Mon, 5 Mar 90 15:12:17 -0800
for weekly@msri.org
Received: by ames.arc.nasa.gov (5.61/1.2); Mon, 5 Mar 90 15:12:10 -0800
Received: by sjsumcs.SJSU.EDU (4.12/smail2.5/07-22-89)
id AA05846; Mon, 5 Mar 90 15:10:31 pst
Date: Mon, 5 Mar 90 15:10:31 pst
From: alperin@sjsumcs.sjsu.edu (Roger Alperin)
Message-Id: <9003052310.AA05846@sjsumcs.SJSU.EDU>
To: david@msri.org, weekly@msri.org
Subject: Re: MSRI Seminar Announcements, Feb 19-23
Hi,
The last announcement I received was Feb. 16. Am I still on
the list. Do you have the schedule for the Number Theory
Workshop which is coming up soon.
Roger Alperin
∂05-Mar-90 1601 @Sunburn.Stanford.EDU:mad@mambo.Stanford.EDU My Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 16:01:35 PST
Received: from Mambo.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06127; Mon, 5 Mar 90 16:02:08 -0800
Received: by mambo.Stanford.EDU (4.1/inc-1.0)
id AA05235; Mon, 5 Mar 90 16:01:51 PST
Date: Mon, 5 Mar 90 16:01:51 PST
From: mad@mambo.Stanford.EDU (Marcia A. Derr)
Message-Id: <9003060001.AA05235@mambo.Stanford.EDU>
To: phd-adm@sunburn.stanford.edu
Subject: My Hoang
Andrew,
I'd like to review the strengths of My Hoang's application that the
committee considered in admitting her. I also want to address some of
the concerns you listed in your recent message protesting her admittance.
My Hoang's academic performance at Wellsley has been outstanding.
She's excelled in both Mathematics and Computer Science. Her GRE
Quantative and Analytical scores are high and her verbal score
is comparable to the other non-native English speakers who were
admitted. She has done independent reading and research and was
selected by her department to do an Honors Thesis (an option available
only to the best students). Moreover, her work was accepted
for the Poster Session at the ACM Computer conference. I think that
this is a demonstration of her potential for research. Her extremely
positive recommendations add further strength to her case.
I had concerns about her low CS GRE score so I called one of her
recommenders, Dr. Sami Khuri, to get more information. He explained
that My had not studied in particular for the CS exam. Moreover,
she had not yet taken some of the systems courses that would have
strengthened her background for taking the exam. He said she
is taking those systems courses now and expected that she'd do very
well as she has in all her other courses.
She was a member of Wellsley's ACM programming team and
she's worked as a student consultant in the computer lab, demonstrating
that she doesn't have systems-phobia as some theory students do.
On taking courses at MIT: I discussed this with both Dr. Khuri and Eric
Roberts (who used to teach in the CS department at Wellsley). While
in principle, it is possible to take courses at MIT, in practice
it is very difficult to manage in terms of geographics and
scheduling. For instance, some of the MIT courses require that large
amounts of time be spent using computer facilities at MIT, and this is
much more difficult for a Wellsley student who isn't resident at MIT.
Math/CS majors have even more difficulty scheduling MIT courses given
constraints placed on them by the Math Major.
I don't think that My Hoang's lack of MIT courses reflects a lack
of motivation and I don't think it should count against her.
In the overall ranking of Round 2 applicants My Hoang placed 46th, with
scores of 4.0-4.5 from all but two of the raters (rpg gave her
3.7). She was judged to be in the middle of the Round 2 applicants
(47.99 percentile to be exact). Furthermore, in the polling that
took place concerning her yesterday, I believe that 7 out of 9 voted
to admit her. I think yesterday's decision should stand.
Marcia
∂05-Mar-90 1628 @Sunburn.Stanford.EDU:RPG@SAIL.Stanford.EDU re: My Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 16:28:26 PST
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08175; Mon, 5 Mar 90 16:28:53 -0800
Message-Id: <85tN2@SAIL.Stanford.EDU>
Date: 05 Mar 90 1627 PST
From: Dick Gabriel <RPG@SAIL.Stanford.EDU>
Subject: re: My Hoang
To: mad@MAMBO.STANFORD.EDU, phd-adm@SUNBURN.STANFORD.EDU
[In reply to message from mad@mambo.Stanford.EDU sent Mon, 5 Mar 90 16:01:51 PST.]
I agree with Marcia's analysis. I should explain my rating system.
1.0 - 1.9 means forget it
2.0 - 2.9 means there is serious question about ability to pursue a graduate
and post-graduate career.
3.0 - 3.9 means there is some concern about that ability
4.0 - 4.9 means there is no question.
5.0 means give a PhD immediately and offer a faculty position.
The abilities I care about are knowledge of CS, strong math background,
broad general background, evidence of research abilities, evidence of
research inclination/motivation, evidence of ability to communicate
results, and comfort they will finish a PhD (for example, a candiate
shouldn't have the bright shiny object syndrome). Within each category,
the decimal is subjective. So, 3.7 means there is some concern (the low CS
GRE, the lack of outside [MIT] courses), but the .7 part means I think
there are reasons that justify the weakness and which bring her to nearly
no-doubt level.
Therefore, a 3.7 from me is a good score.
-rpg-
∂05-Mar-90 2235 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU re: My Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 22:35:10 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14711; Mon, 5 Mar 90 22:35:40 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA29352; Mon, 5 Mar 90 22:34:57 -0800
Date: Mon, 5 Mar 1990 22:34:56 PST
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: Dick Gabriel <RPG@SAIL.Stanford.EDU>
Cc: mad@MAMBO.STANFORD.EDU, phd-adm@SUNBURN.STANFORD.EDU
Subject: re: My Hoang
In-Reply-To: Your message of 05 Mar 90 1627 PST
Message-Id: <CMM.0.88.636705296.ango@Hudson.Stanford.EDU>
Dick,
Your message confirms my claim of an error in this case.
Did you re-examine the file?
Here are just a one point to illustrate my claim:
> The abilities I care about are knowledge of CS ...
If you care to examine her transcript, you will not find much systems,
software, or hardware courses there. I doubt you'll find even a half
of advanced CS courses we require of our undergrads.
When I said that the committee made a mistake in this case, I was quite
serious. Before you jump to protect the decision, consider re-examining
the file and making very sure of your position. Calibrate the GPA and
letters by the quality of Wellsley program in CS.
--Andrew
∂05-Mar-90 2257 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: My Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Mar 90 22:57:13 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14887; Mon, 5 Mar 90 22:57:45 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA29403; Mon, 5 Mar 90 22:57:06 -0800
Date: Mon, 5 Mar 1990 22:57:04 PST
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: mad@mambo.Stanford.EDU (Marcia A. Derr)
Cc: phd-adm@sunburn.stanford.edu
Subject: Re: My Hoang
In-Reply-To: Your message of Mon, 5 Mar 90 16:01:51 PST
Message-Id: <CMM.0.88.636706624.ango@Hudson.Stanford.EDU>
Marcia,
I do agree with your arguments.
> My Hoang's academic performance at Wellsley has been outstanding.
This may be so, compared to other Wellsley students in CS/Math, which is
not very meaningful, since Wellsley is weak in these areas (unlike
liberal arts and premed subjects).
> She's excelled in both Mathematics and Computer Science.
Her background in both Math and CS is quite superficial -- see the transcript
and CS GRE scores. Look at the Stanford requirements for Math and CS
degrees -- there is over a year's worth of study she is missing in each
major.
> Moreover, her work was accepted for the Poster Session at the ACM Computer
> conference.
How does this work? Is there a strict review process, or is it something
anybody can do?
> I had concerns about her low CS GRE score so I called one of her
> recommenders, Dr. Sami Khuri, to get more information. He explained
> that My had not studied in particular for the CS exam. Moreover,
> she had not yet taken some of the systems courses that would have
> strengthened her background for taking the exam. He said she
> is taking those systems courses now and expected that she'd do very
> well as she has in all her other courses.
> She was a member of Wellsley's ACM programming team and
> she's worked as a student consultant in the computer lab, demonstrating
> that she doesn't have systems-phobia as some theory students do.
What you are saying here is that YOUR GUESS is that after taking a few
systems courses she'll have adequate CS background and do well on CS GRE.
However, this is just a guess. If you care to examine her transcript,
you will notice that she is missing courses in compilers, hardware,
architecture, operating systems, and programming languages.
In other words, most of advanced non-theory undergraduate material.
This includes the courses that MIT/Berkeley CS undergraduates (the two
groups I am familiar with) find most difficult and time-consuming.
By the way, her low GRE score reflects the state of her current knowledge
of Computer Science.
> On taking courses at MIT: I discussed this with both Dr. Khuri and Eric
> Roberts (who used to teach in the CS department at Wellsley). While
> in principle, it is possible to take courses at MIT, in practice
> it is very difficult to manage in terms of geographics and
> scheduling. For instance, some of the MIT courses require that large
> amounts of time be spent using computer facilities at MIT, and this is
> much more difficult for a Wellsley student who isn't resident at MIT.
> Math/CS majors have even more difficulty scheduling MIT courses given
> constraints placed on them by the Math Major.
My point was that the potential of getting an excellent education was there.
I agree that there are lots of reasons why taking a CS course at MIT is
harder then taking one at Wellsley.
In summary, the application demonstrates a POTENTIAL of getting an adequate
background in CS or a closely related field, not the EXISTENCE of such a
background. Even this potential is not crystal-clear due to the lack of
herd-core hardware/software courses (ones that require large amount of time
spent at sophisticated computer facilities). I am sure that I can find an
applicant we rejected who ALREADY HAS a strong CS background.
As far as DEMONSTRATED potential for research in the field of interest,
I do not see any. I do not mean to say that the potential is not there;
all I am saying is that the demonstrated research potential is no higher
then that of an average Round 1 applicant. An theory faculty member may be
able to convince me otherwise, although I will be hard; others should not try.
I hope that after a careful re-examination of the file, the majority of the
committee members will agree with me.
--Andrew
∂06-Mar-90 0206 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 02:06:02 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16367; Tue, 6 Mar 90 02:06:36 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA07368; Tue, 6 Mar 90 02:06:45 PST
Date: Tue, 6 Mar 90 02:06:45 PST
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9003061006.AA07368@coraki.stanford.edu>
To: phd-adm@cs.Stanford.EDU
Subject: Hoang
As with many other applicants, Hoang's case depends on the relative
weights assigned to various criteria, in this case:
* GPA +
* Perception of school -
* Strength of recommendations +
* Perception of recommenders -
* Quantitative GRE (the traditional leveler) +
* Other GRE scores -
* Apparent breadth +
* Extent of CS preparation -
Those criteria I've annotated + support her case extremely well, the
-'s undermine it. Thus her GPA is straight A's except for one B (much
better than many we admitted), but they are Wellesley A's. Her
recommenders are wildly enthusiastic, more so than those of many we
admitted, but who among us know the recommenders? She had only one
wrong answer in her quantitative GRE, as good as many we admitted, but
her CS GRE says she doesn't know how many columns in a punchcard. The
letters claim a better balance of interest and ability between theory
and systems than many we admitted, and she was on the school
programming team. However she has relatively little CS preparation
judging by her CS courses and CS GRE.
Anyone wishing to make a strong case either way will find plenty of
grist for their mill here.
She was among the nine of the 44 admittees not in my top 44, but she
headed those nine, so there are eight admittees I have to dispose of
before I can dispute her admission.
-v
∂06-Mar-90 0816 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 08:16:16 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18889; Tue, 6 Mar 90 08:16:50 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA00899; Tue, 6 Mar 90 08:16:15 -0800
Date: Tue, 6 Mar 1990 8:16:14 PST
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: Vaughan Pratt <pratt@cs.Stanford.EDU>
Cc: phd-adm@cs.Stanford.EDU
Subject: Re: Hoang
In-Reply-To: Your message of Tue, 6 Mar 90 02:06:45 PST
Message-Id: <CMM.0.88.636740174.ango@Hudson.Stanford.EDU>
Great, now I know a sure way to get into Stanford for anyone with an IQ
high enough to get a high quantitative GRE score:
1. Find a really bad school and get accepted there.
2. Get good grades (easy for a smart person in a bad school).
3. Get great recommendation letters -- you are the best student this school
have ever seen, and will ever see.
4. Apply and get admitted.
You are saying that we should admit a CS undergraduate who does not know
much of CS. You must be joking, Dr. Pratt!
--Andrew
∂06-Mar-90 0831 stager@Sunburn.Stanford.EDU Spring Quarter TA Interviews
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 08:31:25 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19209; Tue, 6 Mar 90 08:31:28 -0800
Date: Tue, 6 Mar 1990 8:31:27 GMT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: stager@Sunburn.Stanford.EDU, jimenez@Sunburn.Stanford.EDU,
dewerk@Sunburn.Stanford.EDU
Subject: Spring Quarter TA Interviews
Message-Id: <CMM.0.88.636741087.stager@Sunburn.Stanford.EDU>
We're currently accepting TA applications for Spring Qtr. appointments.
Most applications should be in by tomorrow (Wednesday, March 7), so
applicant lists will be run and sent out to Spring Qtr. instructors the
end of this week.
Please send me a message if you'd like to set aside any time during Dead Week
to meet with applicants. I'll be gathering together your
responses and sending out a general message to applicants next Tuesday.
Thanks.
Claire
∂06-Mar-90 0850 LOGMTC-mailer MSRI Seminar Announcements, Feb 19-23
Received: from msri.org (euclid.msri.org) by SAIL.Stanford.EDU with TCP; 6 Mar 90 08:49:57 PST
Received: by msri.org (AIX 2.1.2/s2.2)
id AA05593; Tue, 6 Mar 90 08:36:03 PST
Received: by brahms.berkeley.edu (5.61/1.32)
id AA05267; Tue, 6 Mar 90 08:38:41 PST
Date: Tue, 6 Mar 90 08:38:41 PST
From: catalina@brahms.berkeley.edu (Catalina Carpenter)
Message-Id: <9003061638.AA05267@brahms.berkeley.edu>
To: alperin@sjsumcs.sjsu.edu
Cc: david@msri.org, weekly@msri.org
In-Reply-To: <9003052310.AA05846@sjsumcs.SJSU.EDU> (alperin@sjsumcs.sjsu.edu)
Subject: MSRI Seminar Announcements, Feb 19-23
Yes, you are on the list. The reason why you haven't received the
schedule is that I myself did not get one two weeks ago, and the
one for this week's schedule I received it late last Friday; therefore,
it was too late for me to mail it out. I suggest that from now on you
call the MSRI and ask them to put you on their email list, this way you
will get a copy through email as soon as it is available.
Thanks,
Catalina
∂06-Mar-90 0958 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 09:58:33 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22923; Tue, 6 Mar 90 09:58:58 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA08341; Tue, 6 Mar 90 09:59:10 PST
Message-Id: <9003061759.AA08341@coraki.stanford.edu>
To: "Andrew V. Goldberg" <ango@hudson.stanford.edu>
Cc: phd-adm@coraki.stanford.edu
Subject: Re: Hoang
In-Reply-To: Your message of Tue, 6 Mar 1990 8:16:14 PST.
<CMM.0.88.636740174.ango@Hudson.Stanford.EDU>
Date: 06 Mar 90 09:59:09 PST (Tue)
From: pratt@cs.Stanford.EDU
Andrew, my apologies if my message about Hoang irritated you. I see
now that my message could be taken as inflammatory. My point is that
Hoang's case maximizes the opportunity for controversy: *extremely*
strong on some criteria, weak in others. Those cases with such extreme
variation will generate the most controversy. If you found some other
reading offensive, I clearly should have expressed my point
differently.
A major advantage of the democratic procedure followed by the committee
is that controversy can rage up to but no further than the vote, which
is the deciding factor and should terminate all subsequent advocacy
(Monday morning quarterbacking is fine). Whether we were individually
for or against this case before the vote, we as a committee need to be
unanimously for it after, or we are not doing our job.
I'm very sorry you weren't able to be present, and I'm also sorry I
wasn't better able to represent your strong opinion on this case at the
time. Unfortunately the pace of the meeting is such that managing one
set of evaluations is more than a full time job.
-v
∂06-Mar-90 1005 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:04:56 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01041; Tue, 6 Mar 90 10:05:13 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23019; Tue, 6 Mar 90 10:02:49 -0800
Message-Id: <9003061802.AA23019@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5556; Tue, 06 Mar 90 11:59:40 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5538; Tue, 06 Mar 90 11:59:35 CST
Date: Tue, 6 Mar 90 11:58:10 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
"William J. Joel" <JZEM@MARIST.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: "William J. Joel" <JZEM%MARIST.BITNET@VM1.NoDak.EDU>
Subject: GRG Seminar Series
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Graphics Research Group Seminar Series
======================================
Title Simulation versus Physically Based Modeling
Speaker William J. Joel
Marist College
Date Thursday, March 22, 1990
Time 9:50 - 11:10 am
Place Lowell Thomas Building Rm. 005
Marist College
North Road
Poughkeepsie, NY 12601
Abstract The need for computer animators to produce animations
using as little CPU time as possible often convinces
the animator to use a simulation instead of a true
physically based model. This talk will explore some
simple examples as well as discuss current work being
performed by other researchers.
+--------------------------------------------------------------------------+
+ The past is but the beginning of a beginning, and all that is +
+ and has been is but the twilight of the dawn. +
+ (The Discovery of the Future, H.G. Wells) +
+--------------------------------------------------------------------------+
Bill Joel
jzem@marist.bitnet
∂06-Mar-90 1006 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Strict deterministic propositional dynamic logic
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:06:20 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01082; Tue, 6 Mar 90 10:06:33 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23276; Tue, 6 Mar 90 10:05:18 -0800
Message-Id: <9003061805.AA23276@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5635; Tue, 06 Mar 90 12:02:11 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5618; Tue, 06 Mar 90 12:00:16 CST
Date: Tue, 6 Mar 90 11:58:20 CST
Reply-To: Miki HERMANN <hermann%loria.crin.fr@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Miki HERMANN <hermann%loria.crin.fr@VM1.NoDak.EDU>
Subject: Strict deterministic propositional dynamic logic
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Halpern and Reif in their article "The propositional dynamic logic of
deterministic, well-structured programs", Theoretical Computer Science
27(1983), pp 127-165; give tribute to Passy before introducing the
axiomatization of SDPDL. Passy's article "Filtration lemma for
deterministic programming algebras" is an 'unpublished manuscript',
cited without further details, therefore I would like to know whether
(an if so, where) it was published in a journal/conference proceedings
or where could I obtain it as a research report, or else where could I
get the unpublished manuscript.
Thank you very much for your cooperation.
Miki HERMANN
Centre de Recherche en Informatique de Nancy
--------------------------------------------
e-mail: hermann@loria.crin.fr
post: CRIN, B.P. 239, F-54506 Vandoeuvre-les-Nancy Cedex, FRANCE
phone: +33 83.91.20.00 ext(poste) 28.68
∂06-Mar-90 1007 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: geometry problem
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:07:48 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01155; Tue, 6 Mar 90 10:08:01 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23367; Tue, 6 Mar 90 10:06:39 -0800
Message-Id: <9003061806.AA23367@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5709; Tue, 06 Mar 90 12:02:19 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5672; Tue, 06 Mar 90 12:01:28 CST
Date: Tue, 6 Mar 90 11:58:34 CST
Reply-To: Christine Piatko <piatko%cu-arpa.cs.cornell.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Christine Piatko <piatko%cu-arpa.cs.cornell.edu@VM1.NoDak.EDU>
Subject: Re: geometry problem
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <9002132315.AA01951@rhmr.com> Richard Schroeppel
<rcs%la.tis.com@VM1.NoDak.EDU> writes:
>Suppose you have a planar polygon, not necessarily convex.
>The interior face of each edge is a mirror.
>A candle is lighted at some interior point. The light spreads
>out, reflects off the mirror edges and spreads further, etc.
>Is any place inside the polygon completely dark?
>
>Rich Schroeppel
>rcs@la.tis.com
As far as I know, this is still an open problem. This problem is stated
on p. 265-6 of Joseph O'Rourke's book "Art Gallery Theorems and Algorithms."
He states "The original poser of the problem is unknown; Klee
popularized the problem in two articles" (which are:
"Is every polygonal region illuminable from some point?"
Amer. Math. Monthly 76 (1969), 180.
"Some unsolved problems in plane geometry,"
Math. Mag. 52 (1979), 131-145.).
For those of you without access to O'Rourke's book, here are the precise
problems, and what is known about them:
"Let P be a polygon and imagine that all of its edges are perfect mirrors.
Is there always at least one interior point from which P is completely
illuminable by a point light bulb? Is P always illuminable from
_each_ of its points? Assume that the light bulb sends out rays in all
directions, and that the standard 'angle of reflection = angle of
incidence' law of reflection holds. Further assume that a light ray is
absorbed if it hits a vertex. Surprisingly, these problems are unsolved for
polygons. However, Klee showed the answers to be 'no' if curved
(differentiable) arcs are permitted."
(In the book are two figures with curved arcs. One shows a region that
is not illuminable from a point x, but is illuminable from another point y.
Basically x is at the center of 2 semicircles, the upper one having a
larger radius than the lower one and there are some bays between the
two arcs. You can use your imagination to reconstruct it from the following:
.---------------------.
/ y \ <== top circular arc
| |
| |
| |
\_ _/| x |\_ _/ <== bay
| |
\_________/ <== bottom circular arc
The other shows a region that is not illuminable from any of its points.
There are two elliptical arcs with foci (a,b) and (a',b') and some bays.
Any light source above the a'b' major axis will not illuminate regions
A' or B', and similarly for below the ab axis. And a light source in A
will bounce into B and back again, never illuminating A' or B'.
You can use your imagination to reconstruct it from the following:
.--------------------------.
/ \ <== top elliptical arc
| |
| |
| a b |
\___A___/\ /\___B____/ <== bays
| |
| |
_______ | | ________
/ A' \/ \/ B' \ <== bays
| a' b' |
| |
| |
\ / <== bottom elliptical arc
\__________________________/
).
O'Rourke goes on to say:
"Although the problem remains unsolved for polygonal regions, some progress
has been made in understanding the behavior of single light rays in a
_rational_ polygon, one whose angles are all rational multiples of $\Pi$.
(Orthogonal polygons are a very special case of rational polygons.) A
single light ray is more usually called a "billiard ball" in the now rather
substantial literature on the subject...
Theorem 10.4 [Boldrighini et al. 1978' Kerckhoff et al. 1985]. Let x be
a point in a rational polygon P and $\Theta$ a direction. Then, except
for a countable number of "exceptional" directions $\Theta$, the path of
a billiard ball issuing from x in the direction $\Theta$ is spatially dense
in P, that is, passes arbitrarily lose to every point of P.
One implication of this result is that every rational polygon is
illuminable from each of its points in the sense that no finite area
region will be left unilluminated; whether an isolated point could remain
in the dark is unclear.
For irrational polygons, almost nothing is known. It is not even known
if every triangle admits a dense billiard path."
C. Boldrighini, M. Keane, and F. Marchetti, "Billiards in polygons,"
Ann. Prob. 6 (1978), 532-540.
S. Kerckhoff, H. Masur, and J. Smillie, "A rational billiard flow is
uniquely ergodic in almost every direction,"
Bull. AMS 13 (1985), 141-142.
Christine (piatko@cs.cornell.edu)
∂06-Mar-90 1021 hall@cis.Stanford.EDU SPECIAL Seminar 3/12
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:21:15 PST
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Tue, 6 Mar 90 10:18:39 PST
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA16572; Tue, 6 Mar 90 10:18:55 PST
Message-Id: <9003061818.AA16572@cis.Stanford.EDU>
To: iclabusers@glacier.Stanford.EDU, cis-people@glacier.Stanford.EDU,
ee-faculty@sierra.Stanford.EDU
Subject: SPECIAL Seminar 3/12
Date: Tue, 06 Mar 90 10:18:52 PST
From: hall@cis.Stanford.EDU
MICROFABRICATED ELECTRIC MOTORS
Seminar on Monday, March 12, 1990 in CIS 101
by
Mehran Mehregany
Microsystems Technology Laboratories
Electrical Engineering and Computer Science Department
Massachusetts Institute of Technology
Abstract
Microfabricated mechanisms and actuators are prerequisites for the
development of monolithic micromechanical systems. Microfabrication
technologies for silicon mechanical devices including passive
mechanisms and electric actuators (micromotors) will be discussed.
These devices use silicon surface micromachining
techniques to create freely moving parts held to the surface of the
silicon wafer with pin bearings. Heavily phosphorus doped
LPCVD polysilicon is used for the structural parts, deposited
silicon dioxide is used for the sacrificial layers, and silicon-rich
LPCVD silicon nitride is used for electrical isolation. Operational
rotary, variable-capacitance, ordinary and harmonic (wobble) side-drive
micromotors have been fabricated with typical rotor diameters of
100-130 microns, air gaps of 1.5 micron, and a rotor thickness of
2.2 microns. Electrical operation of the ordinary and harmonic
side-drive motors have been demonstrated at speeds up to 15,000 rpm and
140 rpm, respectively. Wear and frictional effects are
important in these devices and results from such experimental
measurements in the micromotors will be presented.
∂06-Mar-90 1027 @Sunburn.Stanford.EDU:dill@amadeus.Stanford.EDU Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:27:44 PST
Received: from Amadeus.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24514; Tue, 6 Mar 90 10:28:07 -0800
Received: by amadeus.Stanford.EDU (5.57/Ultrix2.4-C)
id AA15125; Tue, 6 Mar 90 10:30:26 PST
Date: Tue, 6 Mar 90 10:30:26 PST
From: dill@amadeus.Stanford.EDU (David Dill)
Message-Id: <9003061830.AA15125@amadeus.Stanford.EDU>
To: phd-adm@sunburn.Stanford.EDU
Subject: Hoang
My previous message was based on the possibility that the majority
of the committee was confused by the last few minutes of the
meeting, where we un-did a number of "+" candidates. It is
obvious from the messages so far that not many people believe
this (by my count, no one other than myself), so I agree with
Vaughan: the decision has been made and we shouldn't argue
about it further.
Dave
∂06-Mar-90 1031 @Sunburn.Stanford.EDU:RPG@SAIL.Stanford.EDU re: My Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:31:05 PST
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24671; Tue, 6 Mar 90 10:31:34 -0800
Message-Id: <185Yu1@SAIL.Stanford.EDU>
Date: 06 Mar 90 1030 PST
From: Dick Gabriel <RPG@SAIL.Stanford.EDU>
Subject: re: My Hoang
To: ango@HUDSON.STANFORD.EDU, mad@MAMBO.STANFORD.EDU
Cc: phd-adm@Sunburn.Stanford.EDU
[In reply to message from ango@Hudson.Stanford.EDU sent Mon, 5 Mar 1990 22:57:04 PST.]
Well, I'm a little puzzled how to proceed. I guess I am willing to re-examine
the folder because a faculty member in the area of her interest questions
her admittance.
In my analysis of folks, I will substitute strong math background for
knowledge of CS, and from all I could see, nearly every applicant had
a relatively weak math background. I understood that Wellsley is weak
in math, but I didn't think it was as weak as Andy is stating now.
So, how shall we decide what to do? Mike is away, so I suppose Sharon should
set some procedure to use.
If we wish to vote electronically, I stand by my 3.7, which is the
high end of ``some concern.''
-rpg-
∂06-Mar-90 1038 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu procedure
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:38:30 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25285; Tue, 6 Mar 90 10:38:57 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA08542; Tue, 6 Mar 90 10:39:09 PST
Date: Tue, 6 Mar 90 10:39:09 PST
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9003061839.AA08542@coraki.stanford.edu>
To: phd-adm@cs.Stanford.EDU
Subject: procedure
My understanding from Sharon (which she should confirm) is that she has
contacted Mike about this and his decision was to let the committee's
decision stand and proceed with the admissions process.
Re David's question, Hoang was not among those we wait-listed at the end.
-v
∂06-Mar-90 1040 carlstea@sierra.Stanford.EDU Taylor and Francis Publishers
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 10:39:58 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Tue, 6 Mar 90 10:37:52 PST
Date: Tue, 6 Mar 90 10:37:52 PST
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU
Subject: Taylor and Francis Publishers
Message-Id: <CMM.0.88.636748670.carlstea@>
Dr. Julie Lancashire of Taylor and Francis Publishers Ltd. London will be
here on Monday March 19th - and possibly March 20th. If anyone is interested
in speaking with her about publishing a book, please let me know and I will
tell her. She will be at the APS in Anaheim and can also be contacted there
at the Marriott. Mary Carlstead McCullough 238, 3-4639
∂06-Mar-90 1104 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Mar 90 11:03:54 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26973; Tue, 6 Mar 90 11:04:22 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA01876; Tue, 6 Mar 90 11:03:48 -0800
Date: Tue, 6 Mar 1990 11:03:47 PST
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: phd-adm@cs.Stanford.EDU
Subject: Hoang
Message-Id: <CMM.0.88.636750227.ango@Hudson.Stanford.EDU>
What I raised the issue, I was pretty sure that this was a mistake
due to short time available to evaluate the applications. I can see
now that this is not the case.
Since the majority persists in their opinion, there is no reason to hold
on the acceptance letter.
I am still standing behind all my objections regarding the case, and
hold that this is a big mistake. Nothing wrong with this, as long as
the mistake is made in a proper democratic manner. I did all I could to
corrent this problem.
The decision stands. However, I do not want to have any praise, or any
responsibility, for this decision. The rest of the committee can share
the glory.
--Andrew
∂07-Mar-90 1454 ingrid@russell.Stanford.EDU CSLI Calendar, 8 March, vol. 5:20
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Mar 90 14:54:25 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA07357; Wed, 7 Mar 90 14:25:14 PST
Date: Wed, 7 Mar 90 14:25:14 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003072225.AA07357@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 8 March, vol. 5:20
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
8 March 1990 Stanford Vol. 5, No. 20
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 8 MARCH 1990
12:00 noon TINLunch
Cordura 100 Reading: Natural Language and Natural Selection
by Steven Pinker and Paul Bloom
Discussion led by Paul Kiparsky
(kiparsky@csli.stanford.edu)
Abstract in last week's Calendar
CSLI ACTIVITIES FOR THURSDAY, 22 MARCH 1990
12:00 noon TINLunch
Cordura 100 Perceiving Sound Patterns in Time
Robert Port
Departments of Linguistics, Computer Science,
and Cognitive Science
Indiana University
(port@iuvax.cs.indiana.edu)
Abstract below
____________
ANNOUNCEMENT
This is the last Calendar for winter quarter. Although a TINLunch has
been scheduled for 22 March, there will be no Calendar on 15 and 22
March. The next Calendar will be published on 29 March, and regular
Thursday events will resume on 5 April.
____________
TINLUNCH ON 22 MARCH
Perceiving Sound Patterns in Time
Robert Port
How can we perceive patterns that are distributed over time? The
standard view requires a "time window," in which time is mapped onto
physical distance (as in a sound spectrogram). But it will be argued
that time windows are biologically implausible as a representational
basis for recognition of temporal patterns like words. I will
describe connectionist simulations of auditory perception that are fed
a single spectrum-slice at a time, and are trained to recognize
melody-like patterns. The networks have a recurrent memory module of
multiplicative (or sigma-pi) units. Each target "tune" produces a
stable trajectory in the state space of the module. This dynamic
memory learns temporal patterns without saving the inputs themselves,
but by representing relevant information about history and abstract
space. This representation has many useful properties, including
allowing recognition as early in time as the information in the
stimulus allows, and a tendency to be invariant under changes in rate.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
Thursday, 8 March, 3:45 p.m.
Cordura 100
Jeff Pelletier on mass expressions.
____________
SYMBOLIC SYSTEMS FORUM
The Radically Efficient Agent in Context
Susan U. Stucky
Institute for Research on Learning
(stucky.pa@xerox.com)
Thursday, 8 March, 4:15 p.m.
Building 60, Room 61G
If we take mind to be made up of (in part) dynamic internal states
with content, that is, if we take cognitive states to be about things
outside those states, and if we admit that some of these cognitive
states have indexical content, then we arrive at a fundamental
question: what is the relation between the content of language as
externally expressed, and its corresponding internal state?
In this talk, I will put forward a candidate null hypothesis to the
effect that the expressions of language and their corresponding
internal states are equivalently indexical. This hypothesis claims at
once that the contribution of language to natural-language
understanding is perhaps less than we once thought. And it suggests
that the appropriate data for a theory of this sort is the stuff of
ordinary conversation full of the misunderstanding, vagueness, and
ambiguity that seems to pervade it. In the talk, I will argue for the
radical-efficiency hypothesis, lay out the beginnings of an
investigation of its validity, and discuss relevant examples.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Quantum Mechanics Challenges:
Two Presuppositions of Metaphysics
Paul Teller
University of Illinois at Chicago
Friday, 9 March, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Symposium on Linking in Various Frameworks
Coordinator: K. P. Mohanan
(mohanan@csli.stanford.edu)
Speakers: Joan Bresnan, Paul Kiparsky, and Peter Sells
(bresnan@csli.stanford.edu, kiparsky@csli.stanford.edu,
sells@csli.stanford.edu
Friday, 9 March, 3:30 p.m.
Cordura 100
This is the second meeting of the linking symposium. Paul Kiparsky
will be the main speaker.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
A Circumscriptive Theory for Causal and Evidential Support
Eunok Paek
Stanford University
Monday, 12 March, 2:30 p.m.
Margaret Jacks Hall 252
Reasoning about causality is an interesting application area of formal
nonmonotonic theories. Here we focus our attention on a certain
aspect of causal reasoning, namely causal asymmetry. In order to
provide a qualitative account of causal asymmetry, we present a
justification-based approach that uses circumscription to obtain the
minimality of causes. We define the notion of causal and evidential
support in terms of a justification change with respect to a
circumscriptive theory and show how the definition provides desirable
interactions between causal and evidential support.
____________
SITUATION SEMANTICS SEMINAR
Questions
Jonathan Ginzburg
(ginzburg@csli.stanford.edu)
Wednesday, 14 March, 4:00 p.m.
Cordura 100
In the last meeting of this quarter, we will discuss issues relating
to interrogative NPs and quantification in questions.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Sexual Strategies: The Evolution of Human Mating
David Buss
University of Michigan
Wednesday, 14 March, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
∂07-Mar-90 1525 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Simulations of Automata, grammars,...
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Mar 90 15:25:19 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01097; Wed, 7 Mar 90 15:25:22 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08354; Wed, 7 Mar 90 15:25:01 -0800
Message-Id: <9003072325.AA08354@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5880; Wed, 07 Mar 90 16:51:24 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5845; Wed, 07 Mar 90 16:51:21 CST
Date: Wed, 7 Mar 90 16:50:51 CST
Reply-To: Dick Botting <PAAAAAR%CALSTATE.BITNET@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Dick Botting <PAAAAAR%CALSTATE.BITNET@VM1.NoDak.EDU>
Subject: Simulations of Automata, grammars,...
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Is there a place on the internet that has programs for demonstrating
and experiemnting with Turing Machines, PDA, etc etc on a MS/DOS or UNIX
based system - prefereably with a display of states etc....
Reply to
PAAAAAR@Calstate.bitnet
I will summarise and circulate...
Dr. Richard J. Botting,
Department of computer science,
California State University, San Bernardino,
CA 92407
PAAAAAR@CCS.CSUSCC.CALSTATE
paaaaar@calstate.bitnet
PAAAAAR%CALSTATE.BITNET@CUNYVM.CUNY.EDU
rbottin@Atl.Calstate.Edu
∂07-Mar-90 1644 kirsten@isl.Stanford.EDU EE 370 Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Mar 90 16:44:52 PST
Received: from isl.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 7 Mar 90 16:43:08 PST
Received: by isl.Stanford.EDU (4.1/4.7); Wed, 7 Mar 90 16:43:19 PST
Date: Wed, 7 Mar 90 16:43:19 PST
From: kirsten@isl.Stanford.EDU (Kirsten Goodell)
To: ee-faculty@sierra
Subject: EE 370 Seminar
Cc: isl-faculty@isl.Stanford.EDU, msgs@isl.Stanford.EDU
Information Systems Laboratory
EE370 Seminar
Skilling 191, 4:15-5:15 PM
THURSDAY, MARCH 8, 1990
Micromachining the Future
by
Dr. Marc Madou
Teknekron Sensor Development Corporation
ABSTRACT
All types of active electronic devices and microprocessors in a
process control loop are already manufactured from Si in a batch type
of process. Recent developments in the micromachining arena enable
one to also batch fabricate sensors, power sources, and actuator parts
in Si or other materials (e.g. polymers and ceramics).
This seminar is intended to illustrate these recent developments in
micromachining, indicating how bulky analytical equipment is being
replaced by microsensors and how micromachined parts, in general, will
lead to distributed sensing, power and actuating.
The advent of distributed sensing, power, and actuating, in turn, will
require novel means of signal processing and communication. Some
early examples on how this impact is already being felt in some fields
will be given.
∂08-Mar-90 0909 LOGMTC-mailer Parikh talk
Received: from coraki.stanford.edu by SAIL.Stanford.EDU with TCP; 8 Mar 90 09:09:39 PST
Received: by coraki.stanford.edu (4.0/25-eef) id AA12298; Thu, 8 Mar 90 09:10:42 PST
Date: Thu, 8 Mar 90 09:10:42 PST
From: Vaughan Pratt <pratt@cs.stanford.edu>
Message-Id: <9003081710.AA12298@coraki.stanford.edu>
To: logmtc@sail
Subject: Parikh talk
A reminder that Rohit Parikh will be giving a survey talk on logics of
knowledge at 4:15 today, Thursday, in MJ 301.
-v
∂08-Mar-90 1117 stager@Sunburn.Stanford.EDU Spring Quarter Course Evaluations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Mar 90 11:17:16 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22565; Thu, 8 Mar 90 11:16:50 -0800
Date: Thu, 8 Mar 1990 11:16:50 GMT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: instructors@Sunburn.Stanford.EDU, tas@Sunburn.Stanford.EDU
Cc: jimenez@Sunburn.Stanford.EDU, dewerk@Sunburn.Stanford.EDU,
stager@Sunburn.Stanford.EDU
Subject: Spring Quarter Course Evaluations
Message-Id: <CMM.0.88.636923810.stager@Sunburn.Stanford.EDU>
Time again for Tau Beta Pi course surveys to be completed by students in
School of Engineering courses.
Tina Jimenez will be putting together packets containing Tau Beta Pi
course evaluation sheets, a return envelope, evaluation forms and
pencils for each CS course. Your packet(s) will be delivered by courier to
your mailbox (if you have one on campus), or Tina will send a message asking
your TA to pick it up. Packets will be going out today and tomorrow.
Please try to reserve a few minutes in class next week for your students to
fill out the evaluation forms. We'd like to have all forms in no later than
Friday of Dead Week (March 16).
PLEASE NOTE:
***Completed forms should be returned (in the envelope provided) to Tina
Jimenez in CSD-TAC (Tresidder Rm. A-210)*** Please DO NOT return the
forms directly to Terman!
For those of you unfamiliar with the course evaluation process, a short
explanation:
Tau Beta Pi is a School of Engineering honor society that distributes course
evaluation forms, and tallies survey results, for SOE courses. TBP survey
results are regarded seriously by the department, and are given significant
weight when instructor teaching effectiveness is being evaluated.
Questions may be directed to Tina Jimenez at jimenez@sunburn.
Thanks again for your cooperation.
Claire
∂08-Mar-90 1140 LOGMTC-mailer seminar
Received: from Vashti.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Mar 90 11:39:59 PST
Received: by Vashti.Stanford.EDU (5.61/25-eef) id AA03584; Thu, 8 Mar 90 11:37:58 -0800
Date: Thu, 8 Mar 90 11:37:58 -0800
From: Dinesh H. Katiyar <katiyar@Vashti.Stanford.EDU>
Message-Id: <9003081937.AA03584@Vashti.Stanford.EDU>
To: logmtc@sail.stanford.edu
Cc: dale@CENTRAL.CIS.UPENN.EDU
Subject: seminar
------------------------------------------------------------------
seminar
13th march
2:30 pm, mjh 352
------------------------------------------------------------------
The Semantics of a Simple Meta-Language
Dale Miller
University of Pennsylvania
------------------------------------------------------------------
ABSTRACT
A logic involving conjunctions, implications, and quantification
over all simple types is presented. This simple logic is at the
heart of both the Isabelle theorem prover and lambda Prolog and
is easily related to the Edinburgh LF. It has been used to
specify and implement many meta-programming tasks, such as
program transformation and proof checking. I shall use it to
specify both an evaluator and a mixed evaluator for a small
functional programming language. A technique used in specifying
mixed evaluation involves taking an operation defined at
primitive types (here, evaluation) and lifting it up to work on
types of all orders. I will describe how an intuitionistic
interpretation of this logic is required to support this
programming technique and how it is related to the semantic
notion of logical relations. The concept of a Kripke
lambda-model [Mitchell/Moggi, LICS87] is used to make this
latter connection.
------------------------------------------------------------------
∂08-Mar-90 1141 LOGMTC-mailer tuesday seminar
Received: from Vashti.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Mar 90 11:41:32 PST
Received: by Vashti.Stanford.EDU (5.61/25-eef) id AA03590; Thu, 8 Mar 90 11:39:25 -0800
Date: Thu, 8 Mar 90 11:39:25 -0800
From: Dinesh H. Katiyar <katiyar@Vashti.Stanford.EDU>
Message-Id: <9003081939.AA03590@Vashti.Stanford.EDU>
To: logmtc@sail.stanford.edu
Cc: nilsson@cs.Stanford.EDU
Subject: tuesday seminar
---------------------------------------------------------------------
tuesday seminar
13th march
4:15 pm, mjh 301
---------------------------------------------------------------------
ACTNET: An Action-Network Language and its Interpreter
(A Preliminary Report)
Nils J. Nilsson
Rebecca Moore
Mark C. Torrance
---------------------------------------------------------------------
ABSTRACT
ACTNET is a language for specifying concurrent processes and actions
organized in a hierarchical structure. Each process retains control
of its subprocesses and remains active only so long as certain
environmental enabling conditions are satisfied. The language
supports recursion and parameter binding. An interpreter/simulator
interact to execute ACTNET programs by creating and simulating a
dynamically changing network of logical gates.
---------------------------------------------------------------------
note : copies of the paper are available with joyce chandler
---------------------------------------------------------------------
∂08-Mar-90 1456 LOGMTC-mailer Logic/Database Talk (change of time!)
Received: from linz.stanford.edu by SAIL.Stanford.EDU with TCP; 8 Mar 90 14:56:53 PST
Received: by linz.stanford.edu (5.59/25-eef) id AA04611; Thu, 8 Mar 90 14:57:52 PDT
Message-Id: <9003082257.AA04611@linz.stanford.edu>
To: logmtc@sail, nail-local@nimbin
Cc: zm@sail
Subject: Logic/Database Talk (change of time!)
Reply-To: tah@cs.stanford.edu
Date: 08 Mar 90 14:57:47 PST (Thu)
From: Tom Henzinger <tah@linz>
Please note the CHANGE OF TIME (which was caused by a conflict
with Peter Rathmann's orals at noon):
--------------------------------------------------------------
Dr. Jean-Louis Lassez (IBM Yorktown):
QUERYING CONSTRAINTS
Friday, March 9
1:45 pm, MJH 301
∂08-Mar-90 1737 BRACEWELL@STAR2.STANFORD.EDU Executive Committee System
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Mar 90 17:37:10 PST
Received: from STAR2.STANFORD.EDU by sierra.Stanford.EDU (4.1/4.7); Thu, 8 Mar 90 17:34:14 PST
Date: Thu 8 Mar 90 17:33:44-PDT
From: Ronald N. Bracewell <BRACEWELL@STAR2.STANFORD.EDU>
Subject: Executive Committee System
To: ee-faculty@sierra.stanford.edu
Message-Id: <636946424.300000.BRACEWELL@STAR2.STANFORD.EDU>
Mail-System-Version: <VAX-MM(253)+TOPSLIB(138)+PONY(225)@STAR2.STANFORD.EDU>
March 8, 1990
Dear EE Faculty Colleagues:
Yesterday the EE faculty received copies of the viewgraphs shown to a
Visiting Committee on February 7, 1990. One of these viewgraphs, entitled
Billet Availability Due to Retirement, shows that Peterson's billet has been
committed to untenured faculty in ICL and AP, Bracewell's to ISL and Medical
Imaging, Helliwell's to ISL and Medical Imaging, and Eshleman's to ICL and
Silicon Sensors.
This plan for maximum dismemberment of STAR Lab faculty positions is as
much of a surprise to us as we presume it is to you. We were neither
consulted, nor informed.
It has come to our attention that a joint meeting of the EE Executive
Committee and the EE Appointments and Promotions Committee was held more than
a year ago on January 20, 1989, at which the main topic of discussion was the
STAR Lab and its future. No representative of STAR Lab was present.
Informal minutes of the meeting of January 20, 1989 were prepared, but
these minutes were not sent to us until last month.
The Committee "concluded that it should NOT target a future billet for
planetary exploration and that it should NOT target a future billet for remote
sensing." These were the two replacement tenured appointments recommended at
the retreat of June 1988. We, as affected parties, were not
informed that the script had been rewritten.
The consensus of the meeting was "that STAR Lab members could find a
welcome place in other administrative homes. For example, Inan would be
welcome as a member of ISL and Banks could affiliate himself with CSSA.
Presumably suitable homes could be found for Tyler and Vesecky as well".
The basis of collegial respect and trust on which the Electrical
Engineering Department has functioned over the past three or four decades is
threatened, and the validity of the executive committee system is placed in
doubt.
We question actions not taken in accordance with ordinary standards of
openness and consultation among colleagues.
Ron Bracewell Von Eshleman Bob Helliwell
-------
∂09-Mar-90 0823 chandler@Sunburn.Stanford.EDU Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Mar 90 08:23:13 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11265; Fri, 9 Mar 90 08:22:51 -0800
Date: Fri, 9 Mar 1990 8:22:50 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Faculty Lunch
Message-Id: <CMM.0.88.636999770.chandler@Sunburn.Stanford.EDU>
This is to remind you of next Tuesday's faculty lunch. Dave Charron will be
among our guests to discuss patents, etc. See you then.
∂09-Mar-90 1309 turner@sierra.Stanford.EDU Tau Beta Pi
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Mar 90 13:09:47 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Fri, 9 Mar 90 13:06:11 PST
Date: Fri, 9 Mar 90 13:06:11 PST
From: turner@sierra.Stanford.EDU (Sherry A. Turner)
To: ee-faculty@sierra.Stanford.EDU
Cc: ee-adminlist@sierra.Stanford.EDU
Subject: Tau Beta Pi
Message-Id: <CMM.0.88.637016770.turner@>
Tau Beta Pi forms came today and are available in McCullough 150 for you to
pick up.
Thanks,
Sherry Turner
∂09-Mar-90 1434 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU academic senate
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Mar 90 14:34:51 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21621; Fri, 9 Mar 90 14:35:16 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA19349; Fri, 9 Mar 90 14:28:35 PST
Date: Fri, 9 Mar 90 14:28:35 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9003092228.AA19349@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: academic senate
It's time again for academic senate elections. If we all
knew who would be willing to serve we could
concentrate our votes rather than scatter them.
(Somehow, I got elected last year. But, I won't be here
next year so that creates another vacancy.)
If anyone out there is brave enough to suggest to
ac@score that s/he would be willing to serve, that
would give us voters some idea of how to vote.
-Nils
∂09-Mar-90 1551 @Sunburn.Stanford.EDU,@Score.Stanford.EDU:eaf@sumex-aim.stanford.edu response to Nils' query
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Mar 90 15:51:26 PST
Received: from Score.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24805; Fri, 9 Mar 90 15:50:55 -0800
Received: from sumex-aim.stanford.edu by SCORE.STANFORD.EDU with TCP; Fri 9 Mar 90 15:50:43-PST
Received: by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA11169; Fri, 9 Mar 90 15:53:11 PST
Date: Fri, 9 Mar 1990 15:53:10 PST
From: Edward A. Feigenbaum <eaf@sumex-aim.Stanford.EDU>
To: ac@score.stanford.edu
Subject: response to Nils' query
Message-Id: <CMM.0.88.637026790.eaf@sumex-aim.stanford.edu>
I would be willing to run/serve in the Senate.
Ed
∂09-Mar-90 1616 DAVIES@Warbucks.AI.SRI.COM PLANLUNCH -- David Einav -- MArMarch 14 -- Wednesday
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 9 Mar 90 16:16:38 PST
Date: Fri 9 Mar 90 16:08:35-PST
From: DAVIES@Warbucks.AI.SRI.COM (Todd Davies)
Subject: PLANLUNCH -- David Einav -- MArMarch 14 -- Wednesday
To: planlunch@Warbucks.AI.SRI.COM
Message-ID: <637027715.0.DAVIES@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
----------------------------------------------------------------------
OPTIMAL REAL-RESOURCE STRATEGIES --
APPLICATION TO PLANNING WITH UNCERTAIN EFFECTS
David Einav (EINAV@RPAL.COM)
Department of Engineering-Economic Systems, Stanford University
and
Palo Alto Laboratory, Rockwell International Science Center
Wednesday, March 14, 11 a.m., SRI International
333 Ravenswood Avenue, Menlo Park, CA
Building E, Room EJ228
My dissertation develops a family of strategies that are optimal with
respect to expected global cost, and are resource-bounded with respect to
total resource consumption.
The approach is characterized by explicit modeling of the cost and
resource consumption uncertainties inherent in the problem-solving process,
and methods drawn from duality theory and stochastic dynamic programming.
For independent solution methods, the problem of resource-constrained
deliberation before action is solved.
This talk will focus on strategies for inter-dependent methods, and their
application to the problem of planning with uncertain effects. When the
effects of operators are uncertain, the success of the plan cannot be
guaranteed. We assume that the effects of different operators are described by
probability distribution functions over the possible outcomes, and that some
(also uncertain) amount of resources is consumed by operators.
The optimal, resource-constrained strategy is opportunistic (it can
consider many goals simultaneously), and is computed efficiently (in a sense
that not all possible plans need be considered).
These results address problems occurring in automatic emergency-response
systems, design automation, query optimization, operating systems and other
areas characterized by limited computational resources or uncertainty of
effects. They also provide a new insight into the theory of real-time systems.
For example, a response of the system may vary depending on resource
availability, and optimal strategy may require interleaving of the planning
and execution steps.
-------
∂11-Mar-90 0312 LOGMTC-mailer tuesday seminar
Received: from Vashti.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Mar 90 03:12:16 PST
Received: by Vashti.Stanford.EDU (5.61/25-theory-eef) id AA00492; Sun, 11 Mar 90 03:08:54 -0800
Date: Sun, 11 Mar 90 03:08:54 -0800
From: Dinesh Katiyar <katiyar@Theory.Stanford.EDU>
Message-Id: <9003111108.AA00492@Vashti.Stanford.EDU>
To: logmtc@sail.stanford.edu
Subject: tuesday seminar
there are two seminars this week ...
---------------------------------------------------------------------
2:30 pm, mjh 352
The Semantics of a Simple Meta-Language
Dale Miller
University of Pennsylvania
---------------------------------------------------------------------
---------------------------------------------------------------------
4:15 pm, mjh 301
ACTNET: An Action-Network Language and its Interpreter
(A Preliminary Report)
Nils J. Nilsson
Rebecca Moore
Mark C. Torrance
Stanford University
---------------------------------------------------------------------
∂11-Mar-90 1007 @Sunburn.Stanford.EDU:golub@patience.Stanford.EDU whiteboards
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Mar 90 10:07:45 PST
Received: from bravery.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08091; Sun, 11 Mar 90 10:09:18 -0800
Received: by bravery.stanford.edu (4.0/inc-1.5)
id AA02755; Sun, 11 Mar 90 10:15:02 PST
Date: Sun, 11 Mar 1990 10:14:38 PST
From: Gene H. Golub 415/723-3124 <golub@patience.Stanford.EDU>
To: ac@sunburn.stanford.edu
Subject: whiteboards
Message-Id: <CMM.0.88.637179278.golub@>
I recently gave a talk where my transparencies were projected on a
whiteboard. The advantage of this system was that I could make notations and
comments on the whiteboard as I gave the talk. Also, there was no fussing
around with the screen. I would like the chalk board replaced in the seminar
rooms on the second floor of MJH. We could retain the chalk boards on the
sides of the room. Does anyone have an objection to this arrangement?
By the way, I think the furniture in the seminar rooms is disgraceful. The
chairs are uncomfortable and frequently in disrepair. Much of this furniture
was originally in Polya Hall and Serra House. Isn't it time we make some
minor improvements. I don't think the new building will soon be
materializing.
Gene
∂11-Mar-90 1306 @Sunburn.Stanford.EDU:JMC@SAIL.Stanford.EDU re: whiteboards
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Mar 90 13:06:00 PST
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08593; Sun, 11 Mar 90 13:07:18 -0800
Message-Id: <1r89mL@SAIL.Stanford.EDU>
Date: 11 Mar 90 1119 PST
From: John McCarthy <JMC@SAIL.Stanford.EDU>
Subject: re: whiteboards
To: golub@PATIENCE.STANFORD.EDU, ac@SUNBURN.STANFORD.EDU
[In reply to message from golub@patience.Stanford.EDU sent Sun, 11 Mar 1990 10:14:38 PST.]
I dunno. I had a whiteboard in my office and later had it
replaced by a blackboard. Whiteboards are harder to erase and
it's never obvious when a marking pen is used up, so one usually
finds a lot of dead pens on the tray. However, I could live with
white boards. As to chairs, I noticed some very nice seminar
room chairs in 61G on the quad. They have a flexible joint in
the back which makes it possible to lean back.
∂12-Mar-90 0737 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Questions on BNF.
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 07:37:46 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01211; Mon, 12 Mar 90 07:38:07 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13258; Mon, 12 Mar 90 07:36:37 -0800
Message-Id: <9003121536.AA13258@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3996; Mon, 12 Mar 90 09:33:19 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3900; Mon, 12 Mar 90 09:30:57 CST
Date: Sat, 10 Mar 90 13:01:49 CST
Reply-To: Sriram Sankar <sankar%Neon.Stanford.EDU@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Sriram Sankar <sankar%Neon.Stanford.EDU@VM1.NoDak.EDU>
Subject: Questions on BNF.
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Can someone answer, or supply me with references for the following
questions:
1. Characterize languages that are LR, but not LL.
2. Is it possible to translate (automatically) a BNF grammar for a language
known to be LL to a LL grammar?
3. Given a BNF grammar for a language can one (automatically) determine
whether it is (a) LL, (b) LR.
Sriram Sankar,
Research Associate,
Computer Systems Laboratory,
Stanford University,
Stanford, CA 94309.
Email: sankar@cs.stanford.edu.
∂12-Mar-90 0830 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: events mail
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 08:30:21 PST
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14153; Mon, 12 Mar 90 08:30:41 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA18975; Mon, 12 Mar 90 08:30:10 PST
Message-Id: <9003121630.AA18975@coraki.stanford.edu>
To: faculty@cs.stanford.edu
Cc: "Folio/Socrates" <EC.CAT@forsythe.stanford.edu>
Subject: Re: events mail
In-Reply-To: Your message of Mon, 12 Mar 90 07:46:58 PST.
<9003121548.AA13332@Sunburn.Stanford.EDU>
Date: 12 Mar 90 08:30:09 PST (Mon)
From: pratt@cs.Stanford.EDU
From pratt Sun Mar 11 20:34:45 1990
To: ec.cat@forsythe
I'd like to be included on the mailing list for
su.events, if there is such a list.
From: "Folio/Socrates" <EC.CAT@Forsythe.Stanford.EDU>
We do not maintain a mailing list for the Public Events listings
that you see coming from EC.CAT@FORSYTHE.
Lynne Sinclair
Stanford Data Center
There used to be a mailing list for events, does anyone know what
became of it? I don't have the time to read newsgroups, but I do want
to know about upcoming events, so I'd like to continue to get these in
my email.
-v
∂12-Mar-90 0834 emma@russell.Stanford.EDU Reminder
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 08:34:37 PST
Received: from localhost by russell.Stanford.EDU (4.1/inc-1.0)
id AA07812; Mon, 12 Mar 90 08:33:31 PST
Message-Id: <9003121633.AA07812@russell.Stanford.EDU>
To: cordura@russell.Stanford.EDU, ventura@russell.Stanford.EDU,
researchers@russell.Stanford.EDU, administration@russell.Stanford.EDU
Subject: Reminder
Date: Mon, 12 Mar 90 08:33:30 PST
From: emma@russell.Stanford.EDU
On 8 February 1990, the Provost announced to the University a major
initiative to restructure the way in which Stanford conducts its
business.
Communication is an important part of the repositioning process as it
moves forward. I would like to meet with the faculty and staff of
each Independent Lab and Center to review the Provost's announcement
and to answer questions that arise from the announcement. I also want
to listen to suggestions and concerns about the repositioning effort
as it moves forward.
Therefore, I have asked your director to arrange for a meeting to last
up to one hour to discuss the repositioning effort.
-Bob Byers
The meeting has been arranged for Thursday, 15 March 3:15 - 4:15,
Cordura Conference Room.
∂12-Mar-90 0844 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Triangulation of Simple Polygons
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 08:44:49 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00243; Mon, 12 Mar 90 08:44:48 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14701; Mon, 12 Mar 90 08:44:25 -0800
Message-Id: <9003121644.AA14701@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8056; Mon, 12 Mar 90 10:02:45 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7895; Mon, 12 Mar 90 10:00:25 CST
Date: Sat, 10 Mar 90 14:35:23 CST
Reply-To: Waldemar Preilowski <waldi%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Waldemar Preilowski <waldi%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Subject: Triangulation of Simple Polygons
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
please give me information about references on parallel algorithms
for triangulating of Simple Polygons on the Butterfly-network.
We have developed an algorithm for this task that needs
O(n log n) processors and time O( (log n)↑2 ).
I prefer answers by e-mail.
Thanks in advance
Waldemar Preilowski
---------------------------------------------------------------------------
UUCP: waldi@pbinfo.UUCP | Waldemar Preilowski
or waldi@pbinfo.uni-paderborn.de | Universitaet-GH Paderborn
or ...!uunet!unido!pbinfo!waldi | Fachbereich 17-Mathematik/Informatik
| Warburger Str. 100
| D-4790 Paderborn, West Germany
---------------------------------------------------------------------------
∂12-Mar-90 0845 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Second Canandian Conference on Computational Geometry
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 08:45:16 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00266; Mon, 12 Mar 90 08:45:22 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14778; Mon, 12 Mar 90 08:45:48 -0800
Message-Id: <9003121645.AA14778@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3845; Mon, 12 Mar 90 10:08:39 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3751; Mon, 12 Mar 90 10:04:50 CST
Date: Sat, 10 Mar 90 14:54:06 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Rejeanne Levesque <CSISL@UOTTAWA.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Rejeanne Levesque <CSISL%UOTTAWA.BITNET@VM1.NoDak.EDU>
Subject: Second Canandian Conference on Computational Geometry
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
SECOND CANADIAN CONFERENCE
ON
COMPUTATIONAL GEOMETRY
Ottawa, Ontario, Canada August 6-10, 1990
CALL FOR PAPERS
The second Canadian Conference in Computational Geometry will be held at the
University of Ottawa, August 6-10, 1990. Papers presenting original research
in all areas of Computational Geometry are sought. Authors wishing to submit a
paper should send 6 copies of an extended abstract up to 4 pages long by May 16
1990 to the organizing committee chair:
Second Canadian Conference in Computational Geometry
c/o Jorge Urrutia
Department of Computer Science
University of Ottawa
Ottawa, Ontario, Canada K1N 9B4
E.Mail SCCCG@UOTCSI2.BITNET
Authors will be notified of acceptance or rejection by May 30, 1990.
Invited Speakers:
Selim Akl, Queens University
Herbert Edelsbrunner, University of Illinois at Urbana-Champaign
Franco Preparata, University of Illinois at Urbana-Champaign
Godfried Toussaint, McGill University
A camera reay copy of accepted abstracts must arrive before June 30 to be
included in the conference proceedings.
Organizing Committee:
J. Czyzowicz (Universite du Quebec a Hull), F. Dehne (Carleton University),
E. Rivera Campo (Universidad Autonoma Metropolitana, Mexico), J.R. Sack
(Carleton University), I. Stojmenovic (University of Ottawa), G. Toussaint
(McGill University) and J. Urrutia (University of Ottawa).
∂12-Mar-90 0846 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Third International Workshop on Artificial Intelligence and
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 08:46:39 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00332; Mon, 12 Mar 90 08:46:32 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14850; Mon, 12 Mar 90 08:46:23 -0800
Message-Id: <9003121646.AA14850@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4124; Mon, 12 Mar 90 10:08:58 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3977; Mon, 12 Mar 90 10:05:24 CST
Date: Sat, 10 Mar 90 14:54:14 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Marty Golumbic <MARTYGO@YKTVMH.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Marty Golumbic <MARTYGO%YKTVMH.BITNET@VM1.NoDak.EDU>
Subject: Third International Workshop on Artificial Intelligence and
Statistics
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
***** CALL FOR PARTICIPATION *****
Third International Workshop on
ARTIFICIAL INTELLIGENCE AND STATISTICS
January 2-5, 1991
Bahia Mar Hotel, Ft. Lauderdale, Florida, USA
PURPOSE
The workshops on Artificial Intelligence and Statistics have brought
together researchers in AI and Statistics to broaden the flow of
information and encourage interdisciplinary work between the two
fields. Proceedings of the two previous workshops have become standard
references.
FORMAT
To encourage interaction and a broad exchange of ideas, the
presentations will be limited to 30 talks in single-session meetings
during three days. Attendance at the workshop will not be limited,
however. The three days of research presentations will be preceded by
tutorials during the afternoon and early evening of January 2, 1991.
The language will be English.
TOPICS
Participants are invited to discuss their work in areas related to:
Metadata Uncertainty Propagation
Neural Networks Automated Interpretation of Graphs
Statistical Strategy Classification and Machine Learning
Bayesian Networks Discovering Statistical Relationships
Explanation Systems Knowledge Representation for Data Analysis
Consultation Systems Statistical Methods for Knowledge Acquisition
The Second International Workshop, held in January 1989, was jointly
sponsored by the American Association for Artificial Intelligence and
the Society for Artificial Intelligence and Statistics. The proceedings
of that Workshop have been refereed and revised and and will appear
as volume 2 of the Annals of Mathematics and Artificial Intelligence.
A similar arrangement for publication of full-length versions of
selected 1991 Workshop papers is also expected.
TO PARTICIPATE
Two copies of an extended abstract (up to four pages) should be sent by
air mail to W. DuMouchel postmarked before May 31, 1990. Acceptance
notices will be mailed by July 31, 1990. Preliminary papers (up to 20
pages) should be returned by October 31, 1990. The preliminary papers
will be copied and distributed at the workshop. Send correspondence to:
W. DuMouchel, BBN Software Products Corp.
10 Fawcett St., Cambridge, MA 02238, USA
email: dumouchel@bbn.com, phone: (617) 873-8119, fax: (617) 873-8199.
PROGRAM COMMITTEE
Peter Cheeseman NASA, USA
William DuMouchel BBN, USA
Herman Friedman IBM, USA
William Gale AT&T, USA
David Hand Open Univ., UK
Hans Lenz Free Univ., Berlin
Daryl Pregibon AT&T, USA
David Spiegelhalter Med. Res. Council, UK
Sponsored by the Society for Artificial Intelligence And Statistics,
in cooperation with the American Association for Artificial Intelligence.
∂12-Mar-90 0848 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Questions on BNF.
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 08:48:50 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00426; Mon, 12 Mar 90 08:48:59 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14550; Mon, 12 Mar 90 08:40:30 -0800
Message-Id: <9003121640.AA14550@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7626; Mon, 12 Mar 90 10:02:10 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7515; Mon, 12 Mar 90 09:59:51 CST
Date: Sat, 10 Mar 90 14:35:08 CST
Reply-To: Sriram Sankar <sankar%Neon.Stanford.EDU@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Sriram Sankar <sankar%Neon.Stanford.EDU@VM1.NoDak.EDU>
Subject: Questions on BNF.
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Can someone answer, or supply me with references for the following
questions:
1. Characterize languages that are LR, but not LL.
2. Is it possible to translate (automatically) a BNF grammar for a language
known to be LL to a LL grammar?
3. Given a BNF grammar for a language can one (automatically) determine
whether it is (a) LL, (b) LR.
Sriram Sankar,
Research Associate,
Computer Systems Laboratory,
Stanford University,
Stanford, CA 94309.
Email: sankar@cs.stanford.edu.
∂12-Mar-90 0927 wheaton@Sunburn.Stanford.EDU candidates for Assistant Chair for Education
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 09:26:55 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16603; Mon, 12 Mar 90 09:28:24 -0800
Date: Mon, 12 Mar 90 09:28:24 -0800
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9003121728.AA16603@Sunburn.Stanford.EDU>
To: ac@sunburn.Stanford.EDU
Subject: candidates for Assistant Chair for Education
Last Friday, the Search Committee met to discuss the three final candidates
for the Assistant Chair for Education, Peter Henderson, Stuart Reges, and
Eric Roberts. The Committee felt that is is important to get faculty
comments on those candidates before making a recommendation.
We have scheduled the first portion of the Division Directors meeting
tomorrow, Tuesday, March 13, for discussion of the candidates, and we are
inviting the senior faculty to that part of the meeting so that they can
comment before the Committee makes a selection.
The meeting will be in MJH 146 at 1:15 - immediately following the regular
Faculty lunch. Joyce has copies of vitae and letters, which should be read
in her office.
gw
∂12-Mar-90 0933 abbas@isl.Stanford.EDU Demos of EE218
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 09:33:21 PST
Received: from isl.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Mon, 12 Mar 90 09:30:15 PST
Received: by isl.Stanford.EDU (4.1/4.7); Mon, 12 Mar 90 09:30:31 PST
From: abbas@isl.Stanford.EDU (Abbas El Gamal)
To: ee-faculty@sierra, leifer@sierra, losleben@mojave, avb@sun.com
Subject: Demos of EE218
Date: Mon, 12 Mar 90 09:30:26 PST
You are invited to demos of the student EE218 projects on Friday 16, 2:00-5:00
at ERL114 (you can come any time from 2-5).
∂12-Mar-90 1005 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU retreat
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 10:05:51 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18107; Mon, 12 Mar 90 10:05:41 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA20834; Mon, 12 Mar 90 09:57:45 PST
Date: Mon, 12 Mar 90 09:57:45 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9003121757.AA20834@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: retreat
As you know, we have scheduled the CS faculty
retreat at Chaminade for the weekend of May 4 (late
Friday afternoon,
dinner, and evening), through all day Saturday, May 5,
and finishing around Sunday noon, May 6. The format
we used last year worked pretty well, so I recommend
that we follow it again this year (although alternative
suggestions are welcome).
A possible schedule:
May 4: arrive late afternoon
dinner (please tell Joyce if you will be
there for dinner)
7:30: evening session (a topic of general
interest---suggestions sought)
May 5: 30-minute talks by our faculty and some
senior research associates about what
they are doing these days
late afternoon: tennis, volleyball, etc.
evening session (another topic of general
interest---suggestions sought)
May 6: morning: more 30-minute talks
noonish: lunch and departure
Please send soon to Joyce (chandler@cs):
1) suggestions for general topics or anything
else you would like to see discussed
2) a title of your 30-minute talk, if you want to
give one
3) confirmation of your attendance (see below)
Chaminade was able to reserve for us all of the rooms
that they had left (at the time we phoned them). I think
we have about the same number that we had last year.
Since the Department is under some budget pressure,
we will adopt the same policy as last year regarding
rooms,
namely, the Dept. will pay the full cost (room and meals)
for everyone who opts for double occupancy. Joyce
can help arrange for roommates. Anyone desiring a
single room should let Joyce know how you intend to
pay the difference between the double-occupancy rate
and the single rate (personal payment or a charge
number). We may end up having a shortage of
single rooms.
Stay tuned.
-Nils
∂12-Mar-90 1012 gerlach@sierra.Stanford.EDU Tau Beta Pi surveys
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 10:12:28 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 12 Mar 90 10:08:18 PST
Date: Mon, 12 Mar 90 10:08:18 PST
From: gerlach@sierra.Stanford.EDU (Sharon Gerlach)
To: ee-faculty@sierra
Cc: gerlach@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Subject: Tau Beta Pi surveys
Message-Id: <CMM.0.88.637265297.gerlach@>
Greetings,
Joe would like to remind everyone of School policy which states
that ALL classes should have Tau Beta Pi surveys conducted each quarter.
The forms were distributed late this year but Sherry now has them
in McCullough 150.
We have requested these forms be distributed to the Dept at the beginning
of the quarter to avoid processing delays in future.
Sharon
∂12-Mar-90 1219 @Neon.Stanford.EDU:axwang@Baal.Stanford.EDU Last talk of the quarter
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 12:12:32 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12547; Mon, 12 Mar 90 12:07:33 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-eef) id AA00454; Mon, 12 Mar 90 12:05:36 -0800
Message-Id: <9003122005.AA00454@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: Last talk of the quarter
Date: Mon, 12 Mar 90 12:05:34 -0800
From: Alexander Wang <axwang@Baal.Stanford.EDU>
As the schedule stands now, this Thursday's AFLB will be the last one
of the quarter. AFLB will resume on Wednesday, April 4, with a talk
by Leonid Levin. This week's AFLB will be at the usual time and place
(12:00pm, MJH 252). The speaker will be Marshall Bern from Xerox
PARC.
ON-LINE ALGORITHMS FOR LOCATING CHECKPOINTS
Marshall Bern
Xerox PARC
We consider the problem of choosing locations in a long
computation at which to save intermediate results.
Such checkpoints allow faster recomputation of
arbitrary requested points within the computation.
We investigate adaptive solutions to the problem by
abstracting the problem to a quite nonstandard server problem.
In this talk, I'll give some of the proofs not given in the BATS
talk on the same work.
[Joint work with Dan Greene,
Arvind Raghunathan, and Madhu Sudan]
∂12-Mar-90 1221 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU more on TBPs
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 12:21:32 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23075; Mon, 12 Mar 90 12:21:41 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA20966; Mon, 12 Mar 90 12:13:49 PST
Date: Mon, 12 Mar 90 12:13:49 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9003122013.AA20966@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu, instructors@sunburn.stanford.edu,
tas@sunburn.stanford.edu
Subject: more on TBPs
I want to underscore the recent reminder about
making sure that Tau Beta Pi survey forms are
distributed to students in your classes during the last
session or thereabouts of the quarter.
Life becomes very difficult for me when I have to
explain to the Dean at promotion and salary-setting time
why certain courses were not evaluated. Although we
get excellent help from the TAs in distributing these
forms, ultimately it is the faculty's and the instructors'
responsibility to see that the forms get distributed and
then handed back in.
Thanks, -Nils
∂12-Mar-90 1226 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU more on TBPs
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 12:26:02 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23085; Mon, 12 Mar 90 12:22:07 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA20966; Mon, 12 Mar 90 12:13:49 PST
Date: Mon, 12 Mar 90 12:13:49 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9003122013.AA20966@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu, instructors@sunburn.stanford.edu,
tas@sunburn.stanford.edu
Subject: more on TBPs
I want to underscore the recent reminder about
making sure that Tau Beta Pi survey forms are
distributed to students in your classes during the last
session or thereabouts of the quarter.
Life becomes very difficult for me when I have to
explain to the Dean at promotion and salary-setting time
why certain courses were not evaluated. Although we
get excellent help from the TAs in distributing these
forms, ultimately it is the faculty's and the instructors'
responsibility to see that the forms get distributed and
then handed back in.
Thanks, -Nils
∂12-Mar-90 1309 @Sunburn.Stanford.EDU:bthomas@Neon.Stanford.EDU CS523
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 13:08:57 PST
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24168; Mon, 12 Mar 90 13:10:32 -0800
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA18059; Mon, 12 Mar 90 13:09:33 -0800
Date: Mon, 12 Mar 90 13:09:33 -0800
From: Becky Thomas <bthomas@Neon.Stanford.EDU>
Message-Id: <9003122109.AA18059@Neon.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU
Subject: CS523
Prof. McCarthy -
This is just to confirm that you'll be meeting with CS523, the preparatory
seminar for the AI qualifying exam, on Friday at 11:30 in MJH352.
We meet for 90 minutes; the topic for the week is "Perspectives."
The format of the class is up to you. We've had everything from
lectures to open discussions.
(By the way, this is a very small class - 4 people. So discussions are
not unwieldy!)
Becky Thomas
∂12-Mar-90 1339 jones@Sunburn.Stanford.EDU Clarification of Senior Project Requirement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 13:39:50 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25081; Mon, 12 Mar 90 13:30:33 -0800
Date: Mon, 12 Mar 1990 13:30:32 PST
From: "H. Roy Jones" <jones@Sunburn.Stanford.EDU>
To: undergrads@cs.Stanford.EDU
Cc: faculty@cs.Stanford.EDU, jones@Sunburn.Stanford.EDU,
stager@Sunburn.Stanford.EDU
Subject: Clarification of Senior Project Requirement
Message-Id: <CMM.0.88.637277432.jones@Sunburn.Stanford.EDU>
The following memo is an attempt to clarify the intent of and the mechanisms
for fulfilling the senior project requirement and includes some minor
changes. Here is a summary of the changes:
Undergrads
1. There is a new course, CS204, being offered by Jeff Ullman
starting this spring that can count toward the requirement.
2. 191 must be approved in advance and have three signatures: project
sponsor's, advisor's, and undergrad committee designate (currently
me.) In rare cases approved in advance summer or outside work may
count toward the requirement through 191. The stricter control of
191 will not officially go into effect this year (ie if you're
graduating this spring don't worry, but they will apply to the class
of '91).
Faculty
1. Reminder that undergrads can work for units on your research
projects and fulfill the senior project requirement.
2. Clarification of the type of work that is appropriate for 191. It
should be a large group project in which the student's role is well-
defined.
3. For 191 3 signatures are required: project sponsor's, advisor's,
and undergrad committee designate (currently me).
Please let me know if you have any questions or comments.
Roy
____________
Department of Computer Science ROY JONES
Stanford University Acting Assistant Chairman for Education
Stanford, California 94305 (415) 723-3642
To: Undergraduates
From: Roy Jones
Subject: Senior Project Requirement
Date: Monday, March 12, 1990
____________
The senior project is intended to give students experience designing and
implementing a relatively large programming project in a group with
faculty supervision. The requirement is fulfilled by taking 6 units of
CS191, CS194, CS204, CS225AB*, or 6 units of some combination of these
classes.
CS191, Senior Project. This 'course' is simply a mechanism for students
to receive credit for appropriate work done outside of classes, normally
with a research group of a CS faculty member. There is presently no
formal mechanism to arrange such work, although one may be introduced in
the future. Currently, students wishing to choose this option need to
find someone to work with themselves. Students selecting this option
must have their proposal approved IN ADVANCE by the the project sponsor,
his or her advisor, and by a designate of the undergraduate committee
(currently Roy Jones). The proposal should give an overview of the
project, a more detailed description of the student's role, and list the
deliverables. The project also needs to be accepted by the sponsor and
the undergraduate committee designate upon completion. In rare cases,
work in industry, either part-time or summer, may be acceptable for
CS191. In all such cases, the work must be non-proprietary and approved
in advance. All such proposals should be filed with Claire Stager once
they have the signatures required in advance. If the project sponsor
has a CS191 section number, the work will be graded by him/her.
Otherwise, the work will be graded by the undergraduate committee
designate, with the input of the project sponsor.
CS194, Software Project Laboratory. This 3-6 unit course is offered
winter and spring and meets weekly to discuss a variety of issues that
arise in the building of large-scale software systems.
CS204, Undergraduate Programming and Problem Solving Seminar. This 3-6
unit spring course examines the solutions of various problems
emphasizing the research paradigms of computer science and the
development of elegant algorithms.
CS225AB, Declarative Programming. These 3-6 unit spring courses examine
a variety of programming techniques utilized in artificial intelligence
including functional and logic programming, metalevel control, and
partial programming.
* NOTE: 225A will only be counted if taken with 225B.
∂12-Mar-90 1406 @Sunburn.Stanford.EDU:jcm@Iswim.Stanford.EDU Re: My Hoang
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 14:06:00 PST
Received: from iswim.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26722; Mon, 12 Mar 90 14:07:13 -0800
Received: from LOCALHOST by Iswim.Stanford.EDU with SMTP (5.61/25-eef) id AA08050; Mon, 12 Mar 90 14:05:40 -0800
Message-Id: <9003122205.AA08050@Iswim.Stanford.EDU>
To: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
Cc: phd-adm@sunburn.stanford.edu
Subject: Re: My Hoang
In-Reply-To: Your message of Mon, 05 Mar 90 22:57:04 -0800.
<CMM.0.88.636706624.ango@Hudson.Stanford.EDU>
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Mon, 12 Mar 90 14:05:38 -0800
Sender: jcm@Iswim.Stanford.EDU
I am inclined to agree with Andy about this, although
I can also live with the committee's decisions.
Unfortunately, I was not able to attend the
meeting either, but I'm sure I gave her a relatively
low rating, and I believe there are other applicants
who were not admitted who seemed better qualified.
∂12-Mar-90 2059 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU polynomials - a summary of replies
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 20:59:19 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA08767; Mon, 12 Mar 90 20:59:29 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10969; Mon, 12 Mar 90 20:59:53 -0800
Message-Id: <9003130459.AA10969@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6902; Mon, 12 Mar 90 22:59:09 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6822; Mon, 12 Mar 90 22:59:06 CST
Date: Mon, 12 Mar 90 18:17:17 CST
Reply-To: Marek Chrobak <marek%ucrmath.ucr.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Marek Chrobak <marek%ucrmath.ucr.edu@VM1.NoDak.EDU>
Subject: polynomials - a summary of replies
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I would like to thank all people who replied to my posting
about testing non-negativeness of polynomials.
Some people asked where does this problem arise, and my mail
to them bounced.
The specific problem where this arises is the analysis of the
harmonic algorithm for the server problem. Roughly speaking,
the server problem is as follows: you have k mobile servers in
a metric space M. At every time slot a request r in M appears
and you have to decide which server will move to r. The problem
is to find a strategy whose total cost, for each sequence of
requests, is no more than constant times the optimal cost.
The harmonic algorithm is a randomized algorithm which moves
a server with probability proportional to the inverse of its
distance to the request point.
The proof method is to define a potential function equal to the
maximum expected cost of lazy calls of the adversary (lazy call
is on the point where the adversary has his own server). Then
the problem reduces to the question whether the derivative of the
potential (in every possible direction corresponding to an adversary's
move) is bounded by a constant c. If so, then the algorithm achieves
constant c. Bounding the derivative easily reduces to proving that a
certain polynomial is non-negative. (Actually, a number of polynomials,
each corresponding to a different move of the adversary.)
We were able to prove, with the aid of a computer, that this algorithm
achieves constant 3 for 2 servers. We are attacking now the problem
for 3 and more servers.
I will be glad to send copies of our papers to anyone who requests
them.
Below is the summary of all replies I received.
Thanks again to all who replied,
Marek Chrobak
-----------------------------------------------------------
From: vavasis@gvax.cs.cornell.edu (Stephen Vavasis)
The problem
is x'Qx >= 0 for all x >= 0?
where Q is an n-by-n symmetric integer matrix
and x is an n-vector of unknowns was shown to be NP hard by
Murty and Kabadi, Math. Progr. 39 (1987) 117-129.
Your problem posed on sci.math is a generalization of
the above problem where degrees higher than 2 are allowed,
so your problem is at least NP-hard.
-- Steve Vavasis
----------------------------------------------------------
From larsen@math.Princeton.EDU Mon Mar 5 14:17:06 1990
Substituting squares for the variables, this is just the question of
whether a polynomial is positive semi-definite. I think there
is an algorithm of Sturm to determine semi-definiteness. I don't
know its order of growth. You might also look at the work of
Ax and others on writing semi-definite polynomials as sums of
squares of rational functions (no more than 2↑r, r the number of
variables). The argument may be constructive.
-Michael Larsen
--------------------------------------------------------
From: Dr. B. Litow <litow@cvax.cs.uwm.edu>
The most current general complexity result about your question on
real,multivariate polynomial values is in
``The complexity of elementary algebra and geometry''
by Ben-Or,Kozen and Reif in JCSS 32 (1986)
Perhaps your cases are sufficiently specialized so that a better
bound is possible but basically space grows exponentially in the
number of variables. This appears to be somewhat better than
Collins' result of the 70's.
Bruce Litow
----------------------------------------------------------
dgc@math.ucla.edu (David G. Cantor)
Organization: UCLA Department of Mathematics
This is closely related to Hilbert Problem 17, solved by Emil Artin. He
showed that a polynomial with real coefficients is non-negative for all
real values of its variables if and only if it is a sum of squares of
rational functions (not necessarily polynomials) in the same variables.
Theodore Motzkin gave a simple example of such a polynomial which is not
a sum of squares of polynomials.
For the case here, where the variables are are to be non-negative, then
it follows from Artin's reasoning that a polynomial is non-negative
if and only if it is a sum of squares of rational functions, each one
possibly multiplied by one or more of the (non-negative) variables.
For a "logical" proof, see Abraham Robinson's book on Model Theory.
Constructive methods are available. In particular, Tarski published a
decision procedure for the real numbers which handles this problem. The
complexity is quite large however.
In the above any real-closed field can be substituted for the field
of real numbers.
------------------------------------
From: bumby@math.rutgers.edu (Richard Bumby)
See "On sums of squares and on elliptic curves over function fields"
by J. W. S. Cassels, W. J. Ellison, and A. Pfister in J. Number Theory
3(1971), 125-149. This shows that being non-negative for all x_i is
already a difficult question. That paper includes a GREAT quote --
attributed to J. V. Stalin -- that is worth the effort of locating the
article.
David Cantor's posting is also informative, but note that it talks
about writing positive definite polynomials as a sum of squares of
rational functions. I do not think that David meant to slight Shreier
by only referring to Artin as another poster suggested. It occurred
to me after composing this that your restriction to non-negative
variables can be achieved by writing each variable as the square of
another variable. Once in a while you are done a service when your
mailer fails to understand an address.
-----------------------
-----------------------------------------------------------------------
Marek Chrobak email: marek@ucrmath.ucr.edu
Math & CS, UC Riverside phone: (714) 787-3769
-----------------------------------------------------------------------
∂12-Mar-90 2100 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Solution of a filters system ?
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 21:00:04 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA08786; Mon, 12 Mar 90 21:00:03 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10976; Mon, 12 Mar 90 21:00:28 -0800
Message-Id: <9003130500.AA10976@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7107; Mon, 12 Mar 90 22:59:35 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6972; Mon, 12 Mar 90 22:59:29 CST
Date: Mon, 12 Mar 90 18:18:37 CST
Reply-To: Olivier Ridoux <ridoux%irisa.fr@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Olivier Ridoux <ridoux%irisa.fr@VM1.NoDak.EDU>
Subject: Solution of a filters system ?
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I would like to know if their exist known decidability and complexity results
for the solution of a system of filters on finite first-order terms,
without constraint on variable occurrences.
(1) A filter A =< B specifies that a unifier of A and B exists, the domain of
which is in the variables of B.
(2) A filters system is in solved form if every filter satisfies (1).
(3) The solution of a filters system is a substitution that applied to the
system yields a filters system in solved form.
"Finite" and "without constraint" are important:
"without constraint" implies that A =< f(A) is a syntactically valid filters
system,
"finite" (plus the definitions above) implies that f(A) =< A has no solution.
I know the relaxation method (e.g. D. Stott Parker "Partial Order Pogramming"
UCLA CSD-870067) but I have never seen a formal presentation of it, especially
nothing on termination.
I also know of another definition of a filter:
(1') A filter A =< B specifies that a substitution sigma exists that makes
A and sigma(B) equal. But such substitutions are not necessarily unifiers.
Thanks in advance,
Olivier Ridoux
IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
ridoux@irisa.fr
∂12-Mar-90 2103 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Algorithmica Special Issue on On-line Algorithms
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 21:03:06 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA08888; Mon, 12 Mar 90 21:03:18 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10979; Mon, 12 Mar 90 21:01:00 -0800
Message-Id: <9003130501.AA10979@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7787; Mon, 12 Mar 90 23:01:18 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7664; Mon, 12 Mar 90 23:00:07 CST
Date: Mon, 12 Mar 90 18:18:56 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Prabhakar Raghavan <PRAGH@IBM.COM>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Prabhakar Raghavan <PRAGH%IBM.COM@VM1.NoDak.EDU>
Subject: Algorithmica Special Issue on On-line Algorithms
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
Algorithmica Special Issue
on On-Line Algorithms
Algorithmica is dedicating a special issue to on-line
algorithms, in recognition of the growing interest and
considerable recent work in the area.
Authors should note
the benefits of publication in a special issue --- a collection
of high-quality related papers in one volume, plus a guarantee
of publication of accepted papers with minimal time delay.
The emphasis of the special issue is on-line algorithms.
This includes on-line algorithms for resource allocation,
scheduling and dynamic data-structuring; the study of
measures of performance for on-line algorithms and their
relationships; the competitive and/or probabilistic analysis
of on-line algorithms; the role of computational resources in
on-line algorithms; the benefits of lookahead, and other
issues in the design and analysis of on-line algorithms.
All manuscripts will be promptly and carefully refereed.
High-quality manuscripts not accepted for the special issue
because of space limitations may be accepted for a regular issue
of Algorithmica, if the author desires.
Authors should send four copies of a manuscript to
Prabhakar Raghavan
IBM T.J. Watson Research Center
Box 218, Yorktown Heights, NY 10598
by July 31, 1990. Manuscripts should be in a format consistent
with that described in any recent issue of Algorithmica.
∂12-Mar-90 2141 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU corrected version of Computational Geometry Day
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Mar 90 21:41:27 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA10215; Mon, 12 Mar 90 21:41:36 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11185; Mon, 12 Mar 90 21:41:48 -0800
Message-Id: <9003130541.AA11185@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8361; Mon, 12 Mar 90 23:01:26 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8221; Mon, 12 Mar 90 23:00:48 CST
Date: Mon, 12 Mar 90 18:19:10 CST
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Ricky Pollack <pollack@geometry.cims.nyu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Ricky Pollack <pollack%geometry.cims.nyu.edu@VM1.NoDak.EDU>
Subject: corrected version of Computational Geometry Day
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
FOURTEENTH COMPUTATIONAL GEOMETRY DAY
Friday, April 13, 1990
Room 109, Warren Weaver Hall
251 Mercer St., New York, NY 10012
10:00-10:30 - Coffee (13th floor lounge)
10:30-11:15 Roberto Tamassia, Brown University,
Parallelism in Point Location Problems
11:30-12:15 Boris Aronov, DIMACS/Rutgers University,
Selecting Distances in the Plane
12:30-2:00 - Lunch
2:00-3:00 Open Problem Session
3:00-3:45 Bernard Chazelle, Princeton University,
Triangulating a Simple Polygon in O(nlog*n) Time
4:00-5:00 - Wine and Cheese Reception in the 13th floor lounge
For more information contact: Richard Pollack (212) 998-3167
Janos Pach (212) 998-3184
--------------------------------------------------------------------------------
ABSTRACTS:
Roberto Tammasia, Brown University,
Three Dimensional Point Location
We present recent results on parallel techniques for point location
problems. Parallelism in planar point location can be exploited in two
different ways. First, in the preprocessing phase, we can construct
the search structure in parallel for the given subdivision. Second, in
the query phase, we can use the processors to speed up point location.
We present an O(log n)-time parallel algorithm to construct the
separator tree data structure for point location in a planar
subdivision with n vertices. Such data structure is both theoretically
optimal and very efficient in practice. The number of processors is n
for general subdivisions, and n/log n for monotone subdivisions. We
also show how to achieve query time O((log n)/log p) using p
processors. Extensions to spatial point location will be discussed.
(Joint work with J.S. Vitter.)
********************************************************************************
***
Boris Aronov, DIMACS/Rutgers University,
Selecting Distances in the Plane
We describe a randomized algorithm for computing the $k↑{th}$ smallest
distance in a set of $n$ points in the plane, based on Megiddo's
parametric searching technique. The expected running time of our
algorithm is $O(n↑{4/3}\log↑{8/3}n)$. A deterministic version of our
procedure runs in time $O( n↑{3/2} \log↑{5/2} n )$, which improves the
previously best known bound of $O( n↑{9/5} \log↑{4/5} n )$ by Chazelle [Ch].
A simple $O(n \log n)$ time algorithm for computing an approximation of
the median distance is also presented.
This is joint work with Pankaj K. Agarwal, Micha Sharir and Subhash Suri.
********************************************************************************
*****
Bernard Chazelle, Princeton University,
Triangulating a Simple Polygon in O(nlog*n) Time
We will present a divide-and-conquer strategy for triangulating
a simple polygon efficiently. The algorithm is deterministic
and runs in time $O(nlog↑*n)$, where n is the number of vertices.
The same method can also be used to check whether a polygonal curve
is simple.
∂13-Mar-90 1002 stager@Sunburn.Stanford.EDU Autumn Quarter Tau Beta Pi
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Mar 90 10:02:51 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19940; Tue, 13 Mar 90 10:03:26 -0800
Date: Tue, 13 Mar 1990 10:03:25 PST
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Cc: jimenez@Sunburn.Stanford.EDU, dewerk@Sunburn.Stanford.EDU,
stager@Sunburn.Stanford.EDU
Subject: Autumn Quarter Tau Beta Pi
Message-Id: <CMM.0.88.637351405.stager@Sunburn.Stanford.EDU>
Autumn Quarter Tau Beta Pi survey results have finally arrived. Envelopes
will be delivered to your mail boxes later today.
Claire
∂13-Mar-90 1032 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU discussion today
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Mar 90 10:32:24 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21542; Tue, 13 Mar 90 10:33:45 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA21608; Tue, 13 Mar 90 10:25:55 PST
Date: Tue, 13 Mar 90 10:25:55 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9003131825.AA21608@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: discussion today
Today, immediately after the faculty lunch (that is,
starting at about 1:15), the committee in charge
of recommending a candidate for an associate
professor (teaching), which person will also be our asst.
chair
for education, requests the honor of your presence
in mjh 146 to hear your reactions to the various
candidates for that position. The committee feels
that it will be able to make a more informed and
more effective choice if they hear some faculty
input first. Those who have been following this
matter and those who expect to have a strong
opinion on it at the faculty meeting on March
20 (at which the committee will present its final
recommendation) are especially urged to come today!
The finalists are Peter Henderson, Eric Roberts, and
Stuart Reges. Please look at their cv's in Joyce's
office before the discussion.
-Nils
∂13-Mar-90 1122 chandler@Sunburn.Stanford.EDU Calendar Advisory
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Mar 90 11:22:50 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25055; Tue, 13 Mar 90 11:24:06 -0800
Date: Tue, 13 Mar 1990 11:24:05 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Calendar Advisory
Message-Id: <CMM.0.88.637356245.chandler@Sunburn.Stanford.EDU>
This is advance notice of the faculty meeting scheduled for Tuesday, April 3
at 2:30 in MJH-146. Please send me any agenda items.
∂13-Mar-90 1504 ingrid@russell.Stanford.EDU Work/Design Seminar and Linguistics Colloquium this Week
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Mar 90 15:04:42 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA21123; Tue, 13 Mar 90 14:22:50 PST
Date: Tue, 13 Mar 90 14:22:50 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003132222.AA21123@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Work/Design Seminar and Linguistics Colloquium this Week
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Adventures in Participatory Design:
Building the Electronic Working Papers System
Laura De Young
Price Waterhouse Technology Centre
Wednesday, 14 March, 12:15 p.m.
Ventura 17
In an effort to develop a methodology for approaching system design
with a focus on the work to be supported, the workers, and their
environment, it is helpful to look at a concrete example where this
approach has been taken. The Electronic Working Papers project at
Price Waterhouse Technology Centre is one such example. The project
goal is to provide a system for audit documentation, replacing the
paper-based system for developing working papers. The evolving
prototype (EWP) is a special-purpose hypermedia system with a number
of other features specifically designed for meeting this particular
task.
The design team has included auditors as well as systems designers and
researchers. Design decisions have been driven by some mixture of
user needs, technological feasibility, corporate pressure to
standardize, constraints in the work environment, concerns for impact
on the work culture, and technical vision. Some important lessons
have been learned about balancing opposing viewpoints, expanding
perceptions of what is possible, and maintaining a sense of what is
probable.
This presentation will focus on the impact of "our" participatory
design method on the design of the system, with background on the
system itself, what has been done to learn about the task and explore
the work environment, and the political atmosphere within the firm
that makes this approach both possible and difficult.
------------
LINGUISTICS DEPARTMENT COLLOQUIUM
Symposium on Linking in Various Frameworks
Coordinator: K. P. Mohanan
(mohanan@csli.stanford.edu)
Speakers: Joan Bresnan, Paul Kiparsky, and Peter Sells
(bresnan@csli.stanford.edu, kiparsky@csli.stanford.edu,
sells@csli.stanford.edu)
Friday, 16 March, 3:30 p.m.
Cordura 100
This will be the third meeting of the linking symposium. Our speaker
this week is Peter Sells, who will talk about approaches within the
general Government-Binding theory outlook to the problems of "linking"
discussed previously by Joan Bresnan and Paul Kiparsky.
(Annie Zaenen's talk, announced earlier in the week, has been
postponed till spring quarter.)
∂13-Mar-90 1549 DAVIES@Warbucks.AI.SRI.COM REMINDER -- PLANLUNCH WEDNESDAY 11:00 (TOMORROW) -- DAVID EINAV
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 13 Mar 90 15:49:43 PST
Date: Tue 13 Mar 90 15:41:21-PST
From: DAVIES@Warbucks.AI.SRI.COM (Todd Davies)
Subject: REMINDER -- PLANLUNCH WEDNESDAY 11:00 (TOMORROW) -- DAVID EINAV
To: planlunch@Warbucks.AI.SRI.COM
Message-ID: <637371681.0.DAVIES@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
----------------------------------------------------------------------
OPTIMAL REAL-RESOURCE STRATEGIES --
APPLICATION TO PLANNING WITH UNCERTAIN EFFECTS
David Einav (EINAV@RPAL.COM)
Department of Engineering-Economic Systems, Stanford University
and
Palo Alto Laboratory, Rockwell International Science Center
Wednesday, March 14, 11 a.m., SRI International
333 Ravenswood Avenue, Menlo Park, CA
Building E, Room EJ228
-------
∂13-Mar-90 1624 ingrid@russell.Stanford.EDU Fourth Workshop on Unification
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Mar 90 16:24:43 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA21556; Tue, 13 Mar 90 14:44:06 PST
Date: Tue, 13 Mar 90 14:44:06 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003132244.AA21556@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Fourth Workshop on Unification
LOGIC FOR IT CTCS
UNIF'90
FOURTH WORKSHOP ON UNIFICATION
Monday, 9 July - Wednesday, 11 July 1990
Fairbairn House, University of Leeds, United Kingdom
This workshop is fourth in a series of three-day meetings on
unification and related topics, the previous ones having been held in
Val d'Ajol, France, and Lambrecht, West Germany. It is an opportunity
to meet old and new colleagues, to present recent (even unfinished)
work, to discuss new ideas, and to hear from guest speakers.
The workshop is intended for those working in logic programming,
natural-language processing, theoretical computer science, and
term-rewriting. It will be organized in sessions, each session
starting with one or two long talks (up to thirty minutes) and several
short talks (fifteen minutes), each followed by discussion. There
will be three invited lectures, given by H. Ait-Kaci, Bill Rounds, and
A. Herold:
Hassan Ait-Kaci
Title to be announced
Alexander Herold
Constraint Logic Programming -- A Combination of Paradigms
Bill Rounds
Feature Theory: Information and Unification
It is also hoped to organize some systems and software demonstrations.
Anyone wishing to give a demonstration should let us know as soon as
possible, so that we can organize the timetable and ensure the
availability of suitable machines (probably Suns).
A preliminary list of talks submitted is as follows (long talks *, the
others short).
Franz Baader
Unification, Weak Unification, Upper Bound, Lower Bound, and
Generalization Problems *
Marco Bellia and M. Eugenia Occhiuto
Operators for Unification and Most General Instance
Wayne Snyder
An Inference System for Conditional E-Unification and Horn Theories *
James G. Williams
Instantiation Systems and Unification Algorithms *
Juan Bicarregui and Brian Matthews
The Incemental Development of an Algorithm for Matching with
Higher-Order Variables
D. J. Dougherty
Higher-Order Unification via Combinators *
Ross Paterson
Unification of Schemes of Quantified Terms *
Zhenyu Qian
On Combining Lambda- and Equational Unification Procedures *
Michael Hanus
Unification with Type Specifications
Gert Smolka
New Results on Feature Unification *
Muffy Thomas and Phil Watson
An Order-sorted Approach to Generalization
A. Boudet, J.-P. Jouannaud
Overloaded Order-Sorted Associative-Commutative Unification
E. K. Burke
Unification for Nilpotent Monoids
Thomas Filkorn
Unification in Finite Algebras and its Integration into Prolog
Jean-Louis Imbert
On Redundant Inequalities Generated by Fourier's Algorithm *
Konrad Slind
Associative, Commutative, and Left Distributive Unification
D. Boquin and M. Dauchet
Some Remarks about Disunification
Hubert Comon
When can Disunification Lead to a Finite Set of Most General Unifiers? *
Catherine Delor
Study of the Confluence of Disequations Elimination in Equational Problems *
John Darlington and Yi-Ke Guo
Unification and Constraint Solving *
C. and H. Kirchner
Reasoning with Symbolic Constraints *
Catherine Meadows
Applying Equational Unification to the Analysis of Key Distribution Protocols
Marshall Cline
A Linear Parallel-Time Algorithm for N-ary (N-statement) Unification
Andy Mueck
Compilation of Unification
Fairbairn House is part of the campus of the University of Leeds,
close to the city center, about one mile from the railway station, and
is served by the Leeds and Bradford airport. The charge for the
meeting will be 120 pounds, including accommodation, meals, and
conference fee; the rate for students will be 50 pounds. Those wishing
to take advantage of this reduced rate will need to bring a letter
from their institution confirming their student status.
The workshop is receiving support from the SERC "Logic for IT
Initiative." It will be organized by John Truss and Stephen Slebarski
(Leeds), Ursula Martin (Royal Holloway and Bedford New College), and
Tobias Nipkow (Cambridge). Please contact us via e-mail, or write to
Dr. John Truss Telex 556473
School of Mathematics Fax 0532-429925
University of Leeds e-mail jkt@dcs.leeds.ac.uk
Leeds LS2 9JT Telephone 0532-335128
United Kingdom
The number of places at the workshop will be limited to about fifty.
Please return the registration form below as soon as possible to
ensure your participation, enclosing a deposit of 20 pounds (made
payable to the University of Leeds), and in any case not later than
6 APRIL 1990.
Note that this is also the date by which abtracts must be sent by
those giving talks. A preliminary program will be sent out during
May.
[Cut here]
-------------------------------------------------------------------------
REGISTRATION FORM UNIF'90
I want to attend the 4th Workshop on Unification.
First name(s):___________________________________________________________
Last name(s): ___________________________________________________________
Affiliation: ___________________________________________________________
Address: ___________________________________________________________
___________________________________________________________
___________________________________________________________
e-mail: ___________________________________________________________
Arrival __ Monday __ Sunday (__ other___________________)
Departure __ Wednesday __ Thursday
__ I enclose a (nonreturnable) deposit of 20 pounds
(Please pay by British cheque or by foreign banker's draft made
payable to the University of Leeds.)
__ I am a student at ______________________________ and wish to
take advantage of the reduced rate offered.
Please return this form to John Truss at the address given above.
∂14-Mar-90 1352 goossens@bbc.Stanford.EDU ***** SEMINAR *****
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Mar 90 13:52:28 PST
Received: from bbc.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 14 Mar 90 13:50:07 PST
Received: by bbc.Stanford.EDU (4.1/4.7); Wed, 14 Mar 90 13:48:50 PST
From: goossens@bbc.Stanford.EDU (Ronald Goossens)
To: cis-people@glacier.STANFORD.edu, iclabusers@glacier.STANFORD.edu
To: ee-faculty@sierra.STANFORD.edu
To: group@bbc.Stanford.EDU
Cc: goossens@gloworm
Subject: ***** SEMINAR *****
Date: Wed, 14 Mar 90 13:48:45 PST
Dr. Gert-Jan Ouwerling, Philips Research, The Netherlands will speak
on Friday 16. February, 2:00 pm, in CIS-101 on
Non-Destructive 1-D and 2-D Doping Profiling
Using Non-Destructive Methods.
This subject is of key importance to everyone who is interested in
process modeling and IC processing in general. This talk was considered
to be one of the highlights of a recently held conference on test
structures and characterisation in San Diego. It's worth coming!
∂14-Mar-90 1536 goossens@bbc.Stanford.EDU ***** SEMINAR *****
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Mar 90 15:36:34 PST
Received: from bbc.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 14 Mar 90 15:32:01 PST
Received: by bbc.Stanford.EDU (4.1/4.7); Wed, 14 Mar 90 15:30:09 PST
From: goossens@bbc.Stanford.EDU (Ronald Goossens)
To: cis-people@glacier.STANFORD.edu, iclabusers@glacier.STANFORD.edu
To: ee-faculty@sierra.STANFORD.edu
From: group@bbc.Stanford.EDU
Cc: goossens@gloworm
Subject: ***** SEMINAR *****
Date: Wed, 14 Mar 90 13:48:45 PST
Sender: goossens@bbc.Stanford.EDU
> Dr. Gert-Jan Ouwerling, Philips Research, The Netherlands will speak
> on Friday 16. February, 2:00 pm, in CIS-101 on
> xxxxxxxx
>
> Non-Destructive 1-D and 2-D Doping Profiling
> Using Non-Destructive Methods.
>
Correction: Of course I mean Friday, March 16.
Sorry.
∂14-Mar-90 1618 stager@Sunburn.Stanford.EDU Winter Quarter Grade Sheets
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Mar 90 16:18:51 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19290; Wed, 14 Mar 90 16:19:13 -0800
Date: Wed, 14 Mar 1990 16:19:12 PST
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: instructors@Sunburn.Stanford.EDU
Cc: tas@Sunburn.Stanford.EDU, sec@Sunburn.Stanford.EDU,
stager@Sunburn.Stanford.EDU
Subject: Winter Quarter Grade Sheets
Message-Id: <CMM.0.88.637460352.stager@Sunburn.Stanford.EDU>
Dear Winter Quarter Instructor:
Grade sheets have arrived and will be delivered to your mail box shortly.
*****Please return completed sheets to Claire Stager no later than noon,
Monday March 26. Grade sheets may be dropped into the CS-TAC box at MJH,
or sent to CSD Tresidder Rm 101 (Mail Code 3068). Please DO NOT
return completed grade sheets directly to the Registrar's Office!!
Let me know if you haven't received your grade sheet(s) by this Friday
(the 16th).
Thanks for your cooperation.
Claire
∂14-Mar-90 1840 hellman@isl.Stanford.EDU "Star" Admit Meetings
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Mar 90 18:40:36 PST
Received: from isl.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 14 Mar 90 18:39:15 PST
Received: by isl.Stanford.EDU (4.1/4.7); Wed, 14 Mar 90 18:39:54 PST
Date: Wed, 14 Mar 90 18:39:54 PST
From: hellman@isl.Stanford.EDU (Martin Hellman)
To: ee-faculty@sierra
Subject: "Star" Admit Meetings
Cc: kurzweil@sierra, miraflor@sierra
Carmen Miraflor has been, and will be, calling many of you to
arrange meetings with the small number of "star" admits. These
are the students we are most anxious to see come here, and I ask
that you be as accommodating as possible. Thanks very much.
Martin Hellman
Associate Dept Chairman for Graduate Admissions
∂15-Mar-90 0918 chandler@Sunburn.Stanford.EDU ONR Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Mar 90 09:18:35 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA03674; Thu, 15 Mar 90 09:19:32 -0800
Date: Thu, 15 Mar 1990 9:19:32 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: ONR Publication
Message-Id: <CMM.0.88.637521572.chandler@Sunburn.Stanford.EDU>
I have received a VERY LARGE publication from the Office of the Chief of
Naval Research entitled "Computer Science Division Program Summary FY 1989".
If you would like to borrow this publication, please let me know.
∂15-Mar-90 1116 @Sunburn.Stanford.EDU:winograd@loire.stanford.edu EXPERIMENTAL NEW COURSE - CS247 HUMAN-COMPUTER INTERACTION
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Mar 90 11:16:03 PST
Received: from Loire.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07322; Thu, 15 Mar 90 11:16:38 -0800
Received: by loire.stanford.edu (5.59/25-eef) id AA06436; Thu, 15 Mar 90 11:17:33 PDT
Date: Thu, 15 Mar 90 11:17:33 PDT
Message-Id: <9003151917.AA06436@loire.stanford.edu>
From: Terry Winograd <Winograd@csli.Stanford.EDU>
To: masters@cs.Stanford.EDU, undergrad@cs.Stanford.EDU
Subject: EXPERIMENTAL NEW COURSE - CS247 HUMAN-COMPUTER INTERACTION
Cc: faculty@cs.Stanford.EDU, hartfield@applelink.apple.com
During the coming quarter I will be introducing an experimental first
verion of a new course about human-computer interaction. The intended
primary audience is CS Masters students and upper division
undergraduates. The course will involve group project work and
presentations as well as a good deal of reading. Enrollment is
limited, so if you are interested, send me an email message with a
basic description of your status and relevant experience. Preference
will go to those who do not have the option of taking it in future
years, and to those with sufficient prior background that it will be
possible to dive into a project rapidly.
--t
----------------------------------------------------------------
COURSE DESCRIPTION
CS 247: Human-computer interaction
Terry Winograd with Brad Hartfield (Apple)
Spring 89-90
M-W 1:15-2:30 - 3 credits
Issues of human-computer action: including interface design, interface
styles, work design, communication structure and organizational
factors. Students in small groups will develop substantial
user-interface prototypes of systems in situations of actual use,
applying concepts from the course readings and interacting in project
reviews with faculty and other experienced system designers.
Prerequisites: CS109 or equivalent, Programming experience
in C, Lisp or Hypertalk.
Enrollment limited
----------------------------------------------------------------
∂15-Mar-90 1240 @Sunburn.Stanford.EDU:shoham@Hudson.Stanford.EDU PC loner
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Mar 90 12:40:46 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09590; Thu, 15 Mar 90 12:41:32 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA16077; Thu, 15 Mar 90 12:39:47 -0800
Date: Thu, 15 Mar 1990 12:39:46 PST
From: Yoav Shoham <shoham@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: PC loner
Message-Id: <CMM.0.88.637533586.shoham@Hudson.Stanford.EDU>
I need a PC for a period of 10 days starting asap; no special requirements.
Best if I could use it at home. Anyone have a suggestion?
Thanks,
Yoav
∂15-Mar-90 1353 wheaton@Sunburn.Stanford.EDU PC loner
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Mar 90 13:53:22 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA12110; Thu, 15 Mar 90 13:54:05 -0800
Date: Thu, 15 Mar 90 13:54:05 -0800
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9003152154.AA12110@Sunburn.Stanford.EDU>
To: shoham@Hudson.Stanford.EDU
Cc: faculty@cs.Stanford.EDU
In-Reply-To: Yoav Shoham's message of Thu, 15 Mar 1990 12:39:46 PST <CMM.0.88.637533586.shoham@Hudson.Stanford.EDU>
Subject: PC loner
Yoav,
I have a DOS machine that Jim Ball had used in his office. I have it at
home now, because I've been moving some data from 5.25" disks to 3.5"
disks, and the machine has both types of drives. When do you need it -
aside from ASAP? I could bring it in tomorrow. It's a clone "luggable"
with a built-in monitor (small, but readable) if that makes any difference.
There may be a larger monitor for it in CSD-CF.
gw
∂15-Mar-90 1508 chandler@Sunburn.Stanford.EDU Spring Quarter Faculty Lunches
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Mar 90 15:07:57 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15459; Thu, 15 Mar 90 15:08:48 -0800
Date: Thu, 15 Mar 1990 15:08:48 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Spring Quarter Faculty Lunches
Message-Id: <CMM.0.88.637542528.chandler@Sunburn.Stanford.EDU>
We're beginning to put together a schedule for faculty lunches for Spring
Quarter. Does anyone have any "favorite" topics they'd like to have discussed?
∂15-Mar-90 1810 @Sunburn.Stanford.EDU:winograd@loire.stanford.edu CORRECTION to CS247 ANNOUNCEMENT - TIME IS Monday and Wed, 2:15-3:30
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Mar 90 18:10:27 PST
Received: from Loire.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21838; Thu, 15 Mar 90 17:47:52 -0800
Received: by loire.stanford.edu (5.59/25-eef) id AA07583; Thu, 15 Mar 90 17:48:49 PDT
Date: Thu, 15 Mar 90 17:48:49 PDT
Message-Id: <9003160148.AA07583@loire.stanford.edu>
From: Terry Winograd <Winograd@csli.Stanford.EDU>
To: mscs@cs.Stanford.EDU, undergrads@cs.Stanford.EDU
Subject: CORRECTION to CS247 ANNOUNCEMENT - TIME IS Monday and Wed, 2:15-3:30
Cc: faculty@cs.Stanford.EDU, hartfield@applelink.apple.com
Sorry for the error. The announcement was sent out by mistake
indicating an ealier time of day. If you sent in a request to be
included and this produces a conflict for you, please let us know.
Thanks. --t
∂16-Mar-90 0737 @Sunburn.Stanford.EDU:NA.PHL@Forsythe.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Mar 90 07:37:40 PST
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02312; Fri, 16 Mar 90 07:38:27 -0800
Message-Id: <9003161538.AA02312@Sunburn.Stanford.EDU>
Date: Fri, 16 Mar 90 07:36:52 PST
To: faculty@cs.Stanford.EDU
From: "Portia Leet" <NA.PHL@Forsythe.Stanford.EDU>
SCHOOL OF ENGINEERING
MEMORANDUM
March 16, 1990
TO: Faculty, Staff and Students
FROM: Portia Leet
Events Coordinator
RE: Sunrise Club Meeting
March 27, 1990
Professor Ronald K. Hanson of the Mechanical Engineering Department
will address the Sunrise Club on Tuesday, March 27th. His topic
will be "Laser-based Fluorescent Imaging in Gases." The breakfast
meeting begins at 7:30 a.m. at Tresidder Union Oak Lounge West.
Ron Hanson formulates laser-based diagnostic methods to measure the
fundamental physical and chemical parameters of high-temperature
reactive gas flows. In addition to his work with shock tubes, he
develops laser-induced fluorescence techniques for 2-dimensional
imaging in gaseous flows.
If you plan to attend, please respond to na.phl@forsythe or by
phone 5-1585.
To: SUNRISE(CT.JFK,CT.MJF,CT.PAC,CT.VLS,DOWN@SIERRA,EE-FACULTY@SIERRA,
FACULTY@CS,FULLERTON@SIERRA,GD.WRK,GIBBONS@SIERRA,HAGSTROM@SIERRA,
KINO@SIERRA,KRUGER@SIERRA,LEVINTHAL@SIERRA,NA.ADP,NA.PHL,PHD@CS,
REIS@SIERRA,RES-ASSOC@CS,TAJNAI@CS)
∂16-Mar-90 0756 chandler@Sunburn.Stanford.EDU Next Tuesday's faculty lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Mar 90 07:56:43 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA02622; Fri, 16 Mar 90 07:57:47 -0800
Date: Fri, 16 Mar 1990 7:57:46 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@@hplabs@hp.com
Subject: Next Tuesday's faculty lunch
Message-Id: <CMM.0.88.637603066.chandler@Sunburn.Stanford.EDU>
Be sure your calendars are marked for the final faculty lunch of Winter
Quarter. William Gruener will be our guest and will talk about what's going
on with ACM publications. He would be interested in your response as to how
you think ACM could better serve the entire community.
See you Tuesday.
∂16-Mar-90 1020 @RELAY.CS.NET:mazzetti@ed.aaai.org AAAI Fellows
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 16 Mar 90 10:19:47 PST
Received: from relay2.cs.net by RELAY.CS.NET id aa03237; 16 Mar 90 12:19 EST
Received: from [192.31.242.33] by RELAY.CS.NET id aa03831; 16 Mar 90 13:14 EST
Received: from winston.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA00400; Fri, 16 Mar 90 09:27:21 PST
Received: by winston.aaai.org (3.2/AAAI-SMI-3.2)
id AA00354; Fri, 16 Mar 90 09:26:39 PST
Date: Fri, 16 Mar 90 09:26:39 PST
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9003161726.AA00354@winston.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Grosz%pandora@HARVARD.HARVARD.EDU,
Hayes-Roth@SUMEX-AIM.STANFORD.EDU, Hinton@RI.CMU.EDU,
JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Lerman@teknowledge.arpa, Nilsson@score.stanford.edu, RGSmith@SLCS.SLB.COM,
Rich@MCC.COM, ai.lenat@MCC.COM, bobrow@XEROX.COM,
buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM, conway@UM.CC.UMICH.EDU,
duda%polya@score.stanford.edu, engelmore@SUMEX-AIM.STANFORD.EDU,
forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM, hector%ai.toronto.edu@RELAY.CS.NET,
hes@VALLECITO.SCRC.SYMBOLICS.COM, hes@scrc-vallecito.symbolics.com,
marty@cis.stanford.edu, mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu,
reddy@FAS.RI.CMU.EDU, swartout@VAXA.ISI.EDU, woods@HARVARD.HARVARD.EDU
Subject: AAAI Fellows
Cc: mazzetti@winston
Pls read their proposal before our council meeting on Thursday,
March 29 at SU.
Claudia
PS For those who have not responded to my earlier msg about attending
the meeting, please do so.
----- Begin Forwarded Message -----
From bobrow@pooh.parc.xerox.com Fri Mar 16 07:22:41 1990
Return-Path: <bobrow@pooh.parc.xerox.com>
Received: from aaai.org (ed) by winston.aaai.org (3.2/AAAI-SMI-3.2)
id AA00162; Fri, 16 Mar 90 07:22:35 PST
Received: from newell by aaai.org (3.2/AAAI-SMI-3.2)
id AB00195; Fri, 16 Mar 90 07:22:24 PST
Received: from [13.1.100.206] by RELAY.CS.NET id aa21666; 15 Mar 90 19:54 EST
Received: from pooh.parc.Xerox.COM by arisia.Xerox.COM with SMTP
(5.61+/IDA-1.2.8/gandalf) id AA09757; Thu, 15 Mar 90 16:52:46 -0800
Received: from bullwinkle.parc.Xerox.COM by pooh.parc.xerox.com with SMTP
(5.61+/IDA-1.2.8/gandalf) id AA15053; Thu, 15 Mar 90 16:52:17 PST
Date: Thu, 15 Mar 90 16:52 PST
From: Danny Bobrow <bobrow@parc.xerox.com>
Subject: [hayes@parc.xerox.com: final version]
To: mazzetti@aaai.org
Message-Id: <19900316005222.4.BOBROW@BULLWINKLE.parc.xerox.com>
Status: R
AAAI FELLOWS
Proposal prepared by Pat Hayes and Ron Brachman
THE PROPOSAL
We propose to initiate a program of AAAI Fellows, modelled
loosely on the IEEE Fellows program, by which a limited number of
AAAI members of appropriate standing and seniority can be
elected each year to lifetime Fellow status.
The IEEE Fellow program is a longstanding one, and IEEE Fellows
are honored and respected well beyond the bounds of that
organization itself. IEEE has a very tightly monitored and well-
conceived process for choosing Fellows, which is itself worthy of
emulation. In this note, we often use the IEEE procedure as an
inspiration or guideline.
At the end we discuss how to get such a program off the ground,
which raises special problems and will take several years. 1
THE NEED
AAAI is now a decade old, and is clearly the most important
organization for artificial intelligence in the world. With at least
12,000 members, there are now a significant number who claim AI
as their primary field of endeavor, and a large and increasing
number whose primary field of training is AI. Thus, it is now the
case that the primary organization of interest for a great number of
our members is AAAI . All of this is a sign of maturity in the field
and in the association.
In its thirty-some years of existence, AI has had virtually no awards
or means of formal acknowledgement for the work of its members.
The Computers and Thought Award, and recently the Research
Excellence Award, have been given out biennially by IJCAII; these
have honored a grand total of thirteen people. Other organizations,
such as IEEE and ACM, choose to honor a larger segment of their
populations, with a spectrum of awards. In many cases these
organizations have created a special "Fellow" status, to which all
technical members of the organization aspire, and which
commands a great deal of respect. While IEEE limits such status to
0.1% of its members each year, this translates into honors for as
many as 250 of their colleagues each year.
There is always the danger of being presumptuous or self-serving in
bestowing too many awards on ourselves, nevertheless, given that
(1) AAAI has become a significant organization, (2) the number of
pure AI practitioners has grown tremendously, (3) Fellow grade
appointments are considered important in similar organisations,
and (4) the simple fact that so many people in AAAI are truly
worthy of some appropriate honor, it seems appropriate and
important to create a Fellow award for AAAI.
Let us first consider the steady state in which an established Fellow
program is in operation: later we will consider how to get to there
from here.
NUMBER OF FELLOWS
The suggested goal is to aim for the number of active Fellows - that
is, Fellows who have not reached professional retirement - to be
about 2.5% of the total membership. This is about 300 active
Fellows if the membership of the society stays at its current level of
approximately 12,000. 2
Rather than trying to control this directly, we will follow IEEE's lead
of limiting the rate at which new Fellows can be appointed. We
propose that a maximum of 0.2% of the membership -
approximately 24 people at present - be admitted to Fellow status
in any year. This figure makes an inaugural dinner for newly
accepted Fellows into a pleasingly intimate event. 3
NOMINATIONS
We can expect a nomination to be self-contained, so that the
Fellow Committee ( see below ) does not need to come back to the
nominator in order to make its decision. In particular, our
nominations should contain
-- a complete professional history of the candidate
-- a list of the most significant contributions made by the
candidate (with justification), including a single most
significant contribution described in detail
-- evidence of technical accomplishments (publications, patents,
presentations, etc.), with the detailed significance of the top
three stated explicitly
-- AAAI activities (awards, offices held, etc.)
-- other professional activities
-- at least three Fellow Grade written references.
In the latter case, no member of the Executive Committee, the
Council, the Fellow Committee, Fellow Examiner board ( see
below) or Headquarters staff can act as a reference. 4
We should publish detailed specifications of what is required,
perhaps an application form or booklet to be completed and
submitted.
QUALIFICATIONS
Qualifications should include contributions to research, education,
technical leadership, and/or service to AAAI. Individual
contributions should be sustained and significant, but need not be
over all these aspects. Fellows should be recognized as having
unusual distinction in the profession, and made important
contributions. Fellows should normally have a PhD and have been
members of the AAAI for at least five years. The Fellow should be
currently active. Nominations can be made by anyone, but must
include at least 3 recommendations by current Fellows, excluding
those directly involved in the selection process or currently an
officer in the organization.
Practical contributions can also be grounds for electing someone to
Fellow status. In that case, the documentation involves information
like patent applications and grants, and statements to the effect that
a persons contribution to his own organization (which may be
proprietary) has been exceptional and critical.
Following IEEE, we can list these as the criteria which are
considered most important in the evaluation of a candidate: (1)
individual contributions, (2) tangible and verifiable evidence of
technical accomplishment, (3) confidential opinions of Fellow
references who are qualified to judge the work of the candidate, (4)
service to AAAI and the AI profession generally, (5) total years in
the profession. 5
INFRASTRUCTURE AND SELECTION
The administrative business of processing nominations and
generally keeping records of the current state of the program should
be done at the AAAI office in Menlo Park. 6
A Fellow Committee ( FC ) will have overall responsibility for
selecting Fellows. The FC is made up of the Past President (or
someone he or she nominates in their stead and who is accepted by
the committee), two other former presidents of the AAAI, and eight
other Fellows chosen for balance, willingness, and stature. The FC
will do a first filtering of nominations for clearly non-qualified
people, and rule on exceptions. After preliminary filtering, more
detailed opinions on nominations will be sought from a larger set
of around 25 Fellow Examiners. Especial care must be taken to
keep the larger FE set balanced along all the dimensions which are
deemed significant, which might include geographical location,
academic/industrial/federal support, and the area of AI in which
the Examiner works. 7
The exact procedure to be used to consider nominations can be
designed in more detail later,8 but it is important that there is a
procedure, which we must publish and keep to quite strictly, to
avoid even the slightest suggestion of a clique choosing its friends
for Fellow status. This is especially important when the society is
comparatively small so that there is a significant chance that a
nominee is known personally by one of the Examiners; and in any
case it makes the FC members job easier.9
We suggest that the members of the FC must themselves be Fellows,
that they serve for some multiple of two years, that the committee
must replace some fraction (25%) of its members every two years,
the selection of new members must meet the approval of the
Council in a 2/3 majority vote ( which should become routine, but
which is needed to enforce some external monitoring of the overall
procedure ), and no retired member can re-serve on the FC until
two years later. 10
BALANCE/DISTRIBUTION
The committee should take into account balance of all kinds in
making choices among otherwise qualified candidates.
Among the factors that IEEE considers, which might be important
for AAAI as well, are geographic, technical, and industry sector
distribution of its selections. They try to strike a balance amongst
the different EE-related disciplines, amongst industry,
government,and academia, and amongst the different national
origins of their broad membership. The last does not seem to be of
much relevance to AAAI, but the question of balance between
different parts of the field is particularly sensitive.11
FREQUENCY OF ELECTION
Elections should take place every year. Nomination papers should
be at the AAAI office by January 15 each year (some time before
the conference deadline). A meeting of the Fellows Committee can
take place at Spring Symposium, and final decisions should be
made by June 15, so that the new Fellows can be honored at the
National Conference.
AWARDS
Fellows should have something to hang on their office wall. A
plaque or certificate has the minor advantage over a desk ornament
that copies can be made of it to send to bureaucracies of one sort
or another. And there should be a dinner, probably at the
national conference, for newly elected Fellows at which the
certificates can be awarded and the new Fellows can applaud each
other. If an event such as this is a success then it will create its own
traditions.
PUBLICITY
IEEE has an extensive booklet (20 pages) that it distributes to those
interested in making nominations. We would no doubt have to
produce an equally comprehensive publication, and advertise its
existence widely, so that we get nominations from all corners of the
organization. Also, since we would want this award to have some
national significance, in the manner of IEEE Fellows, we would want
to take care to publicize it to the appropriate press, and convince
them of the significance of the awards.
BOOTSTRAPPING
SETTING UP THE MACHINERY
The Council has the job of appointing the initial FC, but none of
them can be on it for the first two years: and the FC in turn have the
job of appointing the Fellow Examiners
THE FIRST FELLOWS - DISCUSSION
The initialization is difficult. To start with a very small group - for
example, presidents of AAAI - which then bootstraps through
nomination is impractical. Either the process of selection would be
an impossible burden on that small set, or else the growth rate
would be too slow. It is important to have a reasonably large
number of people - ideally, a hundred or so - in the initial batch,
or we will die with the work of having to bring new people in, and
not enough people will be in for anyone to care.
There are three requirements on this initial set of Fellows:
-- it should be selected by some objective criterion connected with
AAAI
-- it should be quite large
-- all the names in it should be clearly and uncontroversially of
Fellow status
Unfortunately it may not be possible to satisfy all three, so
compromises may be necessary. The only objective criteria we
have come across simply involve making lists of officers of the
society, members of boards, etc. The first list ( see appendix 1) is
all current and past presidents, secretary/treasurers, councilors and
conference and tutorial chairs of AAAI. This comes to 54 people,
which is not as large as one might hope.
There seem to be two options here to enlarge this list. One is to
add those members of the editorial board of AAAIs recognised
Journal, ie the AI Journal, who are in AAAI. This gives
approximately 75 people.12 The other , more complicated but
more democratic, asks the people on list one of clearly AAAI-
connected people to elect the intial set of Fellows.
To do this we take list one as a set of nominees, and ask it to elect
itself. More precisely, we would proceed as follows. First, ask every
member of list one to suggest up to, say, five other names of people
they consider suitable for election to the status of Fellow, and add
to the list every name which is suggested three or more times. This
might give a list of about 150 names. Now take this new list and ask
everyone on it to vote on whether the others should be admitted to
Fellow status. This can be done with the special ballot form and
procedure described in appendix 2. In this way, the initial status
of Fellow would be sure to reflect a certain breadth of stature in the
field. This might also be quite useful as a way of alpha-testing the
organizational system. It is hard to predict exactly, but this might
get us of the order of a hundred initial Fellows.
NUMBERS
We aim at achieving steady state in five years, by converging to it
by accepting 70 nominations in the first year, 60 the second, and so
on until the sixth year is at steady state. If this worked exactly
according to plan, it would get us exactly to the goal total of 300
active fellows, but this would probably be pruned somewhat by
retirements.
This means, however, that there is quite a heavy load on all these
initial Fellows, since a relatively small subset of them qualify to act
as reviewers of nominations, according to our own rules which
exclude FC and FE members - all Fellows - and current officers.
We propose relaxing our rules slightly during the first two years to
allow a nomination to simply claim that a nominee is sufficiently
well known that one recommendation letter is sufficient. This 'claim
to fame' must be made explicitly, however, and such a nomination
can be rejected simply on the grounds that the nominee is in fact
not that well known to the members of the FC and the FE, and more
letters of recommendation are needed.
-- R. J. Brachman
-- P. J. Hayes
APPENDIX ONE: NAME LISTS
List ONE (51 names) : Chairmen, Councilors, Treasurers and
Presidents of AAAI
Amarel, Saul
Balzer, Robert
Bledsoe , Woodrow
Bobrow, Daniel G.
Brachman, Ronald
Brown, John Seely
Buchanan, Bruce
Charnik, Eugene
Clancey, William
Conway, Lynn
Davis, Randall
Duda, Richard
Feigenbaum, Edward
Fikes, Richard
Forbus, Kenneth D.
Fox , Mark
Genesereth, Michael
Grosz, Barbara
Hart, Peter , Hayes, Patrick
Hinton, Geoffrey
Kehler, Tom
Lehnert, Wendy
Lenat, Douglas
Levesque, Hector
McCarthy, John
McDermott, Drew
McDermott, John
McKeown, Kathleen
Michalski, Ryszard
Minsky, Marvin
Mitchell , Tom
Newell, Allen
Nilsson, Nils
Pereira, Fernando Reddy , Raj
Rich, Charles
Rich, Elaine
Rieger, Charles J.
Rosenschein, Stanley
Shortliffe, Edward
Shrobe, Howard
Smith, Reid
Stefik, Mark
Sussman, Gerald J.
Swartout, William
Tenenbaum, J. Marty
Waltz , David L.
Webber, Bonnie L.
Winston, Patrick H.
Woods, William
List TWO (79 names) : List one plus AIJ Editorial Board *
Amarel S.
Balzer R.
Barrow H. *
Berliner H. *
Bibel W. *
Bledsoe W.
Bobrow, D.G.
R. Boyer *
Brachman R.
Brady M. *
Brown JS
Buchanan B.
Bundy A. *
Carbonell J. *
Charniak E.
Clancey W.
Conway, L
Davis R.
Dechter R. *
Dennett D. *
de Kleer, J. *
Duda R.
Erman L. *
Feigenbaum E.
Forbus K. *
Fox M.
Genesereth M.
Grosz B.
Hart P.
Hayes Pat
Hinton G
Kehler T.
Lehnert W.
Lenat D.
Levesque H.
Lifschitz V. *
Loveland D. *
Lozano-Perez T. *
McCarthy J.
McDermott D.
McDermott J.
McKeon K.
Michalski R.
Mitchell T.
Minsky M. *
Moore R. *
Ngaio,
Nagel H. *
Newell A.
Nilsson N.
Pearl J. *
Perrault CR *
Pereira F.
Pitrat J. *
Pylyshyn Z. *
Reddy R.
Reiter R. *
Rich C.
Rich E.
Rieger C.
Rosenschein S.
Shortliffe E.
Shrobe H.
Smith R.
Stefik M.
Sridharan NS *
Sussman G.
Swartout W.
Tenenbaum JM
Wahlster W. *
Walker D. *
Waltz, D.
Webber B.
Wilks, Y *
Winograd, T *
Winston, P
Woods W
APPENDIX TWO: INITIAL ELECTION
Here is one way to arrange such a ballot. Each member of the list is
asked if they wish to take part ( we should allow people to simply
contract out of the whole scheme if they wish to ), and if so, each is
sent a ballot list of all the participating members so that they can
make one of five votes against each other nominee:
1. Known to be of Fellow status ( ie the voter would be prepared
to write a recommendation if they had the time )
2. Believed to be Fellow status
3. Believed to not yet be of Fellow status
4. Should not be a Fellow: objection to assignment of Fellow
status
5. No opinion ( equivalent to no vote )
The results are computed by first forming a provisional list of
Fellows, including everyone who receives more than 1/3 #1 votes,
or a 2/3 majority of positive ( #1,2 ) over negative ( #3,4 ) votes.
The members of this provisional list then have their TobjectionU
votes examined. Each voter is allowed the weight of three
objections, so if they vote more than three then their votes are
weighted accordingly ( eg someone who makes five #4 votes has
each of them count as 0.6 of a vote. ) Any nominee who receives
a total weighting of three or more objection votes is removed from
the list, and the result is the initial list of AAAI Fellows.
1 Some issues and questions are explored in more detail in
footnotes, which are not intended for public distribution
2 We should err of the side of conservatism, on the grounds that it
will be fairly easy to increase the number at some time in the future
if the society comes to feel that more people deserve this status; but
if we are too cavalier with this honor at the beginning, then the
public reputation of a Fellowship might be devalued, and it will
then be very hard to re-establish it.
3 If we apply the percentage which IEEE uses - .01% per annum -
only two or so new Fellows will be appointed each year, and if the
membership drops significantly, this will come down to less than
one. The difference in size between AAAI and IEEE is two orders
of magnitude, so we must do our own arithmetic.
Let us assume that the mean length of time as an active Fellow
during ones professional life is around twenty years, which means
that on average, people are admitted to Fellowship status at around
age 35. This suggests about 15 new fellows each year in the steady
state, which amounts to about 0.15% of our membership. The 0.2%
figure gives us some leeway.
4 We may need to relax this constraint, and accept somewhat more
abbreviated nominations, in the first couple of years. This is
discussed later.
5 IEEE asks for nominations in three different categories. These
include technical contributions ("Engineer/Scientist"), leadership
("Technical Leader"), and education ("Educator"). Thus, someone
who is a key research leader for the field can be elected Fellow
without necessarily competing with other Fellows on technical
contributions. It isn't obvious that there is any special need for
AAAI to make such distinctions formally.
6 We have to look carefully at just how much of a load this will be,
but it is hard to see where else could provide the needed long-term
administrative framework. Perhaps the burden can be controlled to
some extent by fixing the dates for receipt of applications at certain
times in the year, or perhaps just a single time.
7 This is particularly delicate as there are likely to be some
demarcation disputes, at least in the first few years, in which a
candidate is acknowledged to have the stature suitable for
Fellowship, but some people feel that his work does not really
qualify as AI. This is one way in which we differ from IEEE, and
have our own special problems. Ideally it would be good to have
some way of automatically enforcing some reasonable evenness of
distribution between various categories, and certainly it would be
important for the FC to be alert for any emerging biases or gaps
and take steps to correct them.
8Here is a sketch of a suggested process. Each application is sent,
together with a standardized form on which its value can be rated
on several scales, to a certain number ( say, eight, ie one-third ) of
the Fellow Examiners. These votings are then collated, ideally
using some sort of normalization to account for individual
variations in voting behavior, and preliminary judgements on
acceptability are computed. Some applications can be turned
down at this stage. ( Nominations are never absolutely rejected, but
rated as 'not yet ready for Fellow', a phrase which is carefully
worded so as not to be insulting and to encourage renominations. )
All this can be done by mail from some central location.
The final stage is a meeting of the FC, ideally in person but perhaps
augmented by conference calls, at which individual cases are sorted
out and a final selection of around 20 to 25 fellows is made. At
this stage the applications would have to be read more carefully,
and perhaps each member could be assigned a smaller number to
study and report back on to the whole committee. This might take
quite a while, and it would be necessary to schedule enough time for
it. Certainly it should not be rushed. The IEEE procedure takes a
total of seven months, and we can expect that ours will be similarly
thorough.
9 The IEEE procedure is a progressive filtering of applications.
First, each is sent to one of the IEEE societies and is there ranked on
several scales, and comments on the candidates suitability are
collected. These, together with the application, are then sent to the
FC and examined by at least a third of the members.
Unfortunately there is no natural way we can imitate this, as AAAI
does not have component societies: the idea of the larger group of
Examiners is an attempt to come as close to it as possible.
10 Typically, we will find that some members will take naturally to
the task and will do an excellent job, and the FC will wish to keep
them on, so that the membership criteria should allow this.
11 AI has notoriously been plagued by lacks of agreement between
its practitioners about exactly where its boundaries lie. The early
quarrels have abated, but the disagreements are now appearing in
the more dangerous form of specialist groups forming and defining
their own areas in conscious exclusion of the rest of AI: expert
systems, machine vision, automatic theorem-proving, learning,
qualitative physics, etc. . In many cases people feel that their more
specialized meetings are the forum of choice to present their best
work, and many specialized journals have appeared. And some
people make a conscious effort to dissociate themselves from the
name 'AI'. The Fellowship program could be a powerful uniting
force if it is widely perceived as a real honor and if there is
evidence that it is not restricted to a few subsets of the field. The
best way to do this would be to make a special effort to appoint
Fellows from a wide range of subfields in the first few years.
Vision and robotics are two fields which are notably under-
represented in the set of current AAAI officers. The five-year
membership might be a problem here as well: one can foresee
wanting to bestow the status of Fellow on someone who has only
recently been persuaded to join AAAI. The useful word TordinaryU
will no doubt be of use here.
12 Some believe everyone on these lists to be acceptable as an
initial AAAI Fellow ( in part of course on the grounds of service to
the Society ) while others have some reservations. Some however
feel that a Thit rateU of perhaps 95% is acceptable for such an initial
list, given the difficult circumstances surrounding this initialization
process; while others feel that even - or perhaps especially - at this
early stage, it is essential that some very rigorous process of
selection is used. Certainly, however the initial group is chosen, it
is clear that there will be many equally qualified people only
awaiting nomination, and this group should not consider itself to be
the creme de la creme.
There is a special problem associated with the idea of accepting a
non-100% hit rate, since this would immediately mean that there are
people of similar professional status who would probably not be
made immediately into Fellows. But now suppose one of these is
later invited to be, say, a Council member. It would seem unjust that
this alone should not now qualify them for Fellowship. If we are not
careful, a sense of justice in the FC might lead to a devaluing of the
Fellowship criteria. Keeping the quality high, and seen to be high,
is more important than being fair to individuals.
--------------------
----- End Forwarded Message -----
∂16-Mar-90 1428 @Sunburn.Stanford.EDU,@Aphid.Stanford.EDU:bthomas@rhea.stanford.edu CS523
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Mar 90 14:28:17 PST
Received: from CS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15643; Fri, 16 Mar 90 14:29:48 -0800
Received: from rhea.Stanford.EDU by Aphid.Stanford.EDU with SMTP (5.61/25-eef) id AA13780; Fri, 16 Mar 90 14:28:14 -0800
Received: by rhea.stanford.edu (5.57/Ultrix2.4-C)
id AA09000; Fri, 16 Mar 90 14:27:29 PST
Date: Fri, 16 Mar 90 14:27:29 PST
From: bthomas@rhea.Stanford.EDU (Becky Thomas)
Message-Id: <9003162227.AA09000@rhea.stanford.edu>
To: mccarthy@cs.Stanford.EDU
Subject: CS523
Professor McCarthy -
My apologies for the last-minute cancellation of class today.
I will contact the class members early next quarter and see whether
we can arrange a meeting with you.
Becky Thomas
∂16-Mar-90 1439 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 20 March, 7:30 p.m.
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Mar 90 14:39:06 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA16981; Fri, 16 Mar 90 14:00:49 PST
Date: Fri, 16 Mar 90 14:00:49 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003162200.AA16981@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Syntax Workshop, Tuesday, 20 March, 7:30 p.m.
SYNTAX WORKSHOP
Where's the Mirror Principle? Evidence from Chichewa
Alex Alsina
(alexak@csli.stanford.edu)
Tuesday, 20 March, 7:30 p.m.
Cordura 100
Baker (1985) observed that natural languages are subject to the Mirror
Principle: morphology and the syntax associated to that morphology
must have parallel derivations. In other words, the order of
morphemes in a word must match the order in which the syntactic
processes associated with those morphemes take place. A theory
designed so as to derive the Mirror Principle will not only explain
the necessary connection between the position of an affix in a word
and its semantico-syntactic effect on that word, but may also be able
to account for the grammaticality or ungrammaticality of different
morpheme combinations.
Although there has been an important attempt to build the Mirror
Principle into the design of linguistic theory (in Baker 1988), it
runs into difficulties because it assumes that words may be formed in
the syntax, which is inconsistent with the fact that such
syntactically formed words may undergo nominalizations. Rather than
deriving the Mirror Principle in the syntax, I propose to maintain the
hypothesis that all morphology takes place in the lexicon, including
that morphology which has a direct reflex in the syntax. The Mirror
Principle, then, simply follows from the assumption that operations on
argument structures (such as passivization) are information contained
in the lexical entries of certain affixes: affixation involves not
only the phonological combination of an affix and a stem, but also the
combination (or unification) of their semantico-syntactic information.
This, together with a theory that accounts for the alternations in
grammatical functions of thematic roles within the lexicon, provides
an explanation for the semantic and syntactic differences corresponding
to different morpheme orders and for the ungrammaticality of certain
morpheme orders.
The next workshop will be Tuesday, 3 April. Geoff Pullum will be the
speaker.
∂16-Mar-90 1550 minsky@media-lab.media.mit.edu AAAI Fellows
Received: from media-lab (media-lab.media.mit.edu) by SAIL.Stanford.EDU with TCP; 16 Mar 90 15:48:46 PST
Received: by media-lab (5.57/4.8) id AA29205; Fri, 16 Mar 90 18:46:18 EST
Date: Fri, 16 Mar 90 18:46:18 EST
From: Marvin Minsky <minsky@media-lab.media.mit.edu>
Message-Id: <9003162346.AA29205@media-lab>
To: mazzetti@ed.aaai.org
Cc: Feigenbaum@sumex-aim.stanford.edu, Grosz%pandora@harvard.harvard.edu,
Hayes-Roth@sumex-aim.stanford.edu, Hinton@ri.cmu.edu,
JMC-LIsts@sail.stanford.edu, Lehnert@cs.umass.edu,
Lerman@teknowledge.arpa, Nilsson@score.stanford.edu,
RGSmith@slcs.slb.com, Rich@mcc.com, ai.lenat@mcc.com, bobrow@xerox.com,
buchanan@vax.cs.pitt.edu, clancey.pa@xerox.com, conway@um.cc.umich.edu,
duda%polya@score.stanford.edu, engelmore@sumex-aim.stanford.edu,
forbus@a.cs.uiuc.edu, hart@kl.sri.com,
hector%ai.toronto.edu@relay.cs.net, hes@vallecito.scrc.symbolics.com,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@cs.columbia.edu, reddy@fas.ri.cmu.edu, swartout@vaxa.isi.edu,
woods@harvard.harvard.edu, mazzetti@winston
In-Reply-To: Claudia Mazzetti's message of Fri, 16 Mar 90 09:26:39 PST <9003161726.AA00354@winston.aaai.org>
Subject: AAAI Fellows
On the Fellow specification, I think we should not insist on the PhD
default. This tends to omit many of the most creative contributors to
growing fields -- and AI is still growing. Oliver Selfridge, Ed
Fredkin, Richard Greenblatt, Ray Solomonoff, etc. One function of
Professional Society Fellow programs is to indicate the profession's
respect for accomplishment, as a sort of "second chance" outside the
academic tenure track. Did Cliff Shaw have a Ph.D.? William Gosper?
- Marvin Minsky
P.S. I think those guys should be considered for Honarary Doctorates,
if any of you are in institutions that grant them. M.I.T. doesn't.
∂19-Mar-90 0957 LOGMTC-mailer program synthesis seminar, sri, thurs., 4:30pm ej228
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 19 Mar 90 09:57:04 PST
Return-Path: <WALDINGER@Warbucks.AI.SRI.COM>
Date: Mon 19 Mar 90 09:50:34-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: program synthesis seminar, sri, thurs., 4:30pm ej228
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
colloq@score.stanford.edu, planlunch@Warbucks.AI.SRI.COM,
ba-seminars%@Warbucks.AI.SRI.COM
cc: waldinger@Warbucks.AI.SRI.COM
Message-ID: <637869034.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
ReSent-date: Mon 19 Mar 90 09:56:00-PST
Resent-From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Resent-To: ba-seminars@CSL.SRI.COM, logmtc@sail.stanford.edu
when: Thursday, 22 March, 4:30pm
where: SRI AI Center Conference Room EJ 228
who and what:
Sanjay Bhansali
Department of Computer Science
University of Illinois
Program Synthesis using Derivational Analogy
From an AI perspective the goal of automatic programming is to
formalize the methodology of human programmers, so that they can be
incorporated in an interactive or automated environment.
Three important characteristics of human programmers is top-down
decomposition of complex problems, extensive use of domain knowledge,
and the ability to improve their performance by assimilating and
using past experience in solving problems.
I will describe a system APU, that incorporates these characteristics
to synthesize programs for the Unix operating system domain.
The main components of APU are 1) a knowledge
base of rules about programming paradigms, problem reformulations
and Unix programming, 2) a hierarchical planner that generates a plan
by progressive refinement and 3) an analogical reasoner that uses
analogy to speed-up the derivation of problems.
I'll first give an overview of APU and describe how it generates a program
from its specification. I will then describe the analogical reasoner in
detail. I will show why some of the earlier attempts at using analogy -
termed solution transformation approaches - are inadequate
for program synthesis. I will describe how APU overcomes some
of the problems associated with the earlier approaches by
using derivational analogy. Finally, I'll discuss some of the
theoretical issues involved in derivational analogy systems,
namely, appropriateness, adaptation, correspondence, and partial reuse,
and how these issues are addressed by APU.
SRI is at 333 Ravenswood Avenue, Menlo Park
Visitors please arrive early to sign in.
Guests from us "designated" countries may need to
make prior arrangements (Dori Arceo, 859-2641)
The AI Center is in the Engineering Building.
We apologize if you receive multiple copies of this announcement.
-------
∂19-Mar-90 1005 WALDINGER@Warbucks.AI.SRI.COM program synthesis seminar, sri, thurs., 4:30pm ej228
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 19 Mar 90 10:05:50 PST
Date: Mon 19 Mar 90 09:50:34-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: program synthesis seminar, sri, thurs., 4:30pm ej228
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
colloq@score.stanford.edu, planlunch@Warbucks.AI.SRI.COM,
ba-seminars%@Warbucks.AI.SRI.COM
cc: waldinger@Warbucks.AI.SRI.COM
Message-ID: <637869034.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
when: Thursday, 22 March, 4:30pm
where: SRI AI Center Conference Room EJ 228
who and what:
Sanjay Bhansali
Department of Computer Science
University of Illinois
Program Synthesis using Derivational Analogy
From an AI perspective the goal of automatic programming is to
formalize the methodology of human programmers, so that they can be
incorporated in an interactive or automated environment.
Three important characteristics of human programmers is top-down
decomposition of complex problems, extensive use of domain knowledge,
and the ability to improve their performance by assimilating and
using past experience in solving problems.
I will describe a system APU, that incorporates these characteristics
to synthesize programs for the Unix operating system domain.
The main components of APU are 1) a knowledge
base of rules about programming paradigms, problem reformulations
and Unix programming, 2) a hierarchical planner that generates a plan
by progressive refinement and 3) an analogical reasoner that uses
analogy to speed-up the derivation of problems.
I'll first give an overview of APU and describe how it generates a program
from its specification. I will then describe the analogical reasoner in
detail. I will show why some of the earlier attempts at using analogy -
termed solution transformation approaches - are inadequate
for program synthesis. I will describe how APU overcomes some
of the problems associated with the earlier approaches by
using derivational analogy. Finally, I'll discuss some of the
theoretical issues involved in derivational analogy systems,
namely, appropriateness, adaptation, correspondence, and partial reuse,
and how these issues are addressed by APU.
SRI is at 333 Ravenswood Avenue, Menlo Park
Visitors please arrive early to sign in.
Guests from us "designated" countries may need to
make prior arrangements (Dori Arceo, 859-2641)
The AI Center is in the Engineering Building.
We apologize if you receive multiple copies of this announcement.
-------
∂19-Mar-90 1030 helen@russell.Stanford.EDU Summer Internships
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Mar 90 10:30:14 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA28743; Mon, 19 Mar 90 10:31:57 PST
Date: Mon 19 Mar 90 10:31:56-PST
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: Summer Internships
To: ssp-faculty@russell.Stanford.EDU, ssp-students@russell.Stanford.EDU
Message-Id: <637871516.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
TO: FACULTY AND STUDENTS WORKING ON SSP-CSLI INTERNSHIP APPLICATIONS
I realize, from discussions with some of you, that the intitial "matching
phase", is not as straightforward as we'd imagined it to be. Though we cant
change anything midstream, I wanted to urge any of you with queries, problems,
questions, doubts, and any other need for help and information, to feel free
to contact me about them. I will do as much as possible to act as a conduit,
and provide needed information.
Students, if you're not sure of the "ground-rules", or the best strategy to
follow, do drop by to ask me.
--Helen
Phone: TWTh: 723-4091
MF : 725-2326
-------
∂19-Mar-90 1347 chandler@Sunburn.Stanford.EDU Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Mar 90 13:47:44 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26365; Mon, 19 Mar 90 13:48:39 -0800
Date: Mon, 19 Mar 1990 13:48:37 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: tenured@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Faculty Meeting
Message-Id: <CMM.0.88.637883317.chandler@Sunburn.Stanford.EDU>
Just to remind you of tomorrow's tenured faculty meeting - 2:30 in MJH-146.
I have cv's and recommendation letters in my office.
∂19-Mar-90 1452 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU undergraduate research
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Mar 90 14:51:54 PST
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA29312; Mon, 19 Mar 90 14:43:46 -0800
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA02937; Mon, 19 Mar 90 14:36:46 PST
Date: Mon, 19 Mar 90 14:36:46 PST
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9003192236.AA02937@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: undergraduate research
Cc: vivluo@sunburn.stanford.edu, undergrads@cs.stanford.edu
Dear faculty:
I have had the good fortune to be able to guide the research of some
very smart and hardworking undergraduates this year. Our CS
undergraduates would very much like to be involved in research directed
by one of our faculty. I am sure you will be surprised at the high
quality work of which they are capable. This note is meant to call attention
to this opportunity and (thru a cc to the undergraduates) to hint to them
that they needn't be shy about approaching CS faculty about
research possibilities.
All CS undergraduates are required to complete a senior-project
requirement. There are courses that suffice for this requirement, but
there is also the possibility of doing research with a faculty member,
in which case the student signs up for CS191.
In order to make sure that the research fulfills the purposes of the
senior project requirement, there are some conditions that must be
followed. These are described below:
-------
CS191, Senior Project. This 'course' is simply a mechanism for students
to receive credit for appropriate work done outside of classes, normally
with a research group of a CS faculty member. There is presently no
formal mechanism to arrange such work, although one may be introduced in
the future. Currently, students wishing to choose this option need to
find someone to work with themselves. Students selecting this option
must have their proposal approved IN ADVANCE by the the project sponsor,
his or her advisor, and by a designate of the undergraduate committee
(currently Roy Jones). The proposal should give an overview of the
project, a more detailed description of the student's role, and list the
deliverables. The project also needs to be accepted by the sponsor and
the undergraduate committee designate upon completion. In rare cases,
work in industry, either part-time or summer, may be acceptable for
CS191. In all such cases, the work must be non-proprietary and approved
in advance. All such proposals should be filed with Claire Stager once
they have the signatures required in advance. If the project sponsor
has a CS191 section number, the work will be graded by him/her.
Otherwise, the work will be graded by the undergraduate committee
designate, with the input of the project sponsor.
--------
Try them, you'll like them!
-Nils
∂19-Mar-90 1455 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Computer Forum Annual Meeting 1991
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Mar 90 14:55:02 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00208; Mon, 19 Mar 90 14:55:13 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA06281; Mon, 19 Mar 90 14:53:39 -0800
Date: Mon, 19 Mar 1990 14:53:38 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: hiller@Hudson.Stanford.EDU
Subject: Computer Forum Annual Meeting 1991
Message-Id: <CMM.0.88.637887218.tajnai@Hudson.Stanford.EDU>
The dates have been set for:
Tuesday evening, Feb. 26, through Thursday evening, Feb. 28.
Professors William Miller, Chairman, Vaughan Pratt (CSD), 1991 Program
Chairman, and Edward McCluskey (CSL), 1992 Program Chairman, will
be the faculty representatives on the Forum Committee.
Carolyn Tajnai
∂19-Mar-90 1548 chandler@Sunburn.Stanford.EDU Announcement from NASA
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Mar 90 15:48:36 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA03307; Mon, 19 Mar 90 15:49:17 -0800
Date: Mon, 19 Mar 1990 15:49:16 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Announcement from NASA
Message-Id: <CMM.0.88.637890556.chandler@Sunburn.Stanford.EDU>
I just received the following announcement. I will send you a copy if you
would like to see it.
NASA Research Announcement
Advanced Communications Technology Satellite (ACTS)
Systems Concept Developtment (ASCD) Program
∂20-Mar-90 1420 ingrid@russell.Stanford.EDU CSLI Events, 21 and 22 March 1990
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Mar 90 14:19:57 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA09699; Tue, 20 Mar 90 13:52:24 PST
Date: Tue, 20 Mar 90 13:52:24 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003202152.AA09699@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Events, 21 and 22 March 1990
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Design Course Discussion
Terry Winograd and Brad Hartfield
(winograd@csli.stanford.edu)
Wednesday, 21 March, 12:15 p.m.
Ventura 17
We will discuss our plans for a design-oriented course on
human-computer interaction that we will be inventing next quarter. It
is an experiment and we are looking for suggestions and critiques that
will help us make it work.
COURSE DESCRIPTION (PRELIMINARY VERSION, WHICH MAY CHANGE AS WE GO)
CS 247: Human-Computer Interaction
Terry Winograd with Brad Hartfield (Apple)
Spring 1989-90
Issues of human-computer action: including interface design, interface
styles, work design, communication structure, and organizational
factors. Students in small groups will develop substantial
user-interface prototypes of systems for situations of actual use,
applying concepts from the course readings and interacting in project
reviews with faculty and other experienced system designers.
Primary audience: CS Masters students and upper division undergraduates.
Prerequisites: CS109, experience in C, Lisp, or Hypertalk.
____________
CSLI TINLUNCH
Perceiving Sound Patterns in Time
Robert Port
Departments of Linguistics, Computer Science,
and Cognitive Science, Indiana University
(port@iuvax.cs.indiana.edu)
Thursday, 22 March, 12:00 noon
Cordura 100
How can we perceive patterns that are distributed over time? The
standard view requires a "time window," in which time is mapped onto
physical distance (as in a sound spectrogram). But it will be argued
that time windows are biologically implausible as a representational
basis for recognition of temporal patterns like words. I will
describe connectionist simulations of auditory perception that are fed
a single spectrum-slice at a time, and are trained to recognize
melody-like patterns. The networks have a recurrent memory module of
multiplicative (or sigma-pi) units. Each target "tune" produces a
stable trajectory in the state space of the module. This dynamic
memory learns temporal patterns without saving the inputs themselves,
but by representing relevant information about history an abstract
space. This representation has many useful properties, including
allowing recognition as early in time as the information in the
stimulus allows, and a tendency to be invariant under changes in rate.
∂20-Mar-90 1709 DAVIES@Warbucks.AI.SRI.COM Attention PLANLUNCHERS -- Series of AI Talks at SRI
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 20 Mar 90 17:09:42 PST
Date: Tue 20 Mar 90 16:56:02-PST
From: DAVIES@Warbucks.AI.SRI.COM (Todd Davies)
Subject: Attention PLANLUNCHERS -- Series of AI Talks at SRI
To: planlunch@Warbucks.AI.SRI.COM
Message-ID: <637980962.0.DAVIES@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
Surrounding the AAAI Spring Symposium we will be having several seminars
by visitors to the AI Center at SRI, on a variety of topics. I've listed
them below first in a short form and then with abstracts.
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
----------------------------------------------------------------------
TALKS:
Wednesday, March 21, 10:00 a.m., EJ228
David Magerman, University of Pennsylvania
"Parsing Natural Language Using Generalized Mutual Information"
Host: Bob Moore
Thursday, March 22, 3 p.m., EJ228
Leora Morgenstern, IBM
"Knowledge and the Frame Problem"
Host: Martha Pollack
Thursday, March 22, 4:30 p.m., EJ228
Sanjay Bhansali, University of Illinois
"Program Synthesis Using Derivational Analogy"
Host: Richard Waldinger
Friday, March 23, 10:30 a.m., EJ228
Bart Selman, University of Toronto
"Tractable Commonsense Reasoning Using Defaults"
Host: Kurt Konolige
Monday, March 26, 11 a.m., EJ228
Qiang Yang, University of Waterloo
"ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner"
Host: Todd Davies
Wednesday, March 28, 10:30 a.m., EK242
Masanobu Yamamoto, ETL, Japan and NRC, Canada
"The Visualized Locus Method and the Direct Method in Motion Analysis"
Hosts: Harlyn Baker and Bob Bolles
Thursday, March 29, 1:30 p.m., EK242
Kate Sanders, Brown University
"Within the Letter of the Law: Planning in the Legal Domain"
Host: Martha Pollack
-------------------------------------------------------------------
ABSTRACTS:
David Magerman, a student of Mitch Marcus, will be giving a talk about
work he has been doing with Mitch, on Wednesday March 21 at 10:00 in
EJ228. Here is the abstract:
Parsing Natural Language Using Generalized Mutual Information
David M. Magerman
University of Pennsylvania
Abstract
--------
The standard approach to parsing natural language is using
grammar-based algorithms. While effective at characterizing and
classifying sentences using toy grammars, grammar-based parsing
techniques are only as robust as the grammars they use. But
characterizing concisely the entire grammar of a natural language is
an extremely difficult task.
In this talk, I will present an alternative to the grammar-based
approach, a stochastic parsing method based on finding constituent
boundaries, or distituents, using a generalized mutual information
statistic. This method, called distituent parsing, is based on the
hypothesis that constituent boundaries can be extracted from a given
part-of-speech n-gram by analyzing the mutual information values
within the n-gram. This hypothesis is supported by the performance of
an implementation of this parsing algorithm which determines all
levels of sentence structure from a variety of English text with a
relatively low error rate. During this talk, I will derive the
generalized mutual information statistic, describe the parsing
algorithm, and present results and sample output from the parser. I
will then discuss the potential applications of this approach in
conjunction with traditional grammar-based techniques.
-------
Knowledge and the Frame Problem
Leora Morgenstern
IBM T.J. Watson Research Center
The frame problem, which causes trouble for any reasonably expressive
theory of action, shows up in a strengthened form in integrated theories
of knowledge and action. In this talk, we present two instances of this
strengthened frame problem:
The Third Agent Frame Problem
- which arises in plans involving chains of communication,
and
The Vicarious Planning Frame Problem
- which arises when an agent delegates a part of his plan to others
We show that no amount of frame axioms can solve these problems, and that most
non-monotonic temporal logics are likewise inadequate. We then present a
temporal non-monotonic logic, Epistemic Motivated Action Theory (EMAT),
which handles both of these problems.
Finally, we discuss the relationship of Epistemic Motivated Action Theory to
general multiple agent non-monotonic reasoning. Specifically, we show that
the principles underlying EMAT can be recast as a restricted form of
the "principle of arrogance," which states that agents typically know
what they need to know about the limitations of other agents' beliefs.
----------------------------------------------------------------
when: Thursday, 22 March, 4:30pm
where: SRI AI Center Conference Room EJ 228
who and what:
Sanjay Bhansali
Department of Computer Science
University of Illinois
Program Synthesis using Derivational Analogy
From an AI perspective the goal of automatic programming is to
formalize the methodology of human programmers, so that they can be
incorporated in an interactive or automated environment.
Three important characteristics of human programmers is top-down
decomposition of complex problems, extensive use of domain knowledge,
and the ability to improve their performance by assimilating and
using past experience in solving problems.
I will describe a system APU, that incorporates these characteristics
to synthesize programs for the Unix operating system domain.
The main components of APU are 1) a knowledge
base of rules about programming paradigms, problem reformulations
and Unix programming, 2) a hierarchical planner that generates a plan
by progressive refinement and 3) an analogical reasoner that uses
analogy to speed-up the derivation of problems.
I'll first give an overview of APU and describe how it generates a program
from its specification. I will then describe the analogical reasoner in
detail. I will show why some of the earlier attempts at using analogy -
termed solution transformation approaches - are inadequate
for program synthesis. I will describe how APU overcomes some
of the problems associated with the earlier approaches by
using derivational analogy. Finally, I'll discuss some of the
theoretical issues involved in derivational analogy systems,
namely, appropriateness, adaptation, correspondence, and partial reuse,
and how these issues are addressed by APU.
SRI is at 333 Ravenswood Avenue, Menlo Park
Visitors please arrive early to sign in.
Guests from us "designated" countries may need to
make prior arrangements (Dori Arceo, 859-2641)
The AI Center is in the Engineering Building.
We apologize if you receive multiple copies of this announcement.
-------
Tractable Commonsense Reasoning Using Defaults
Bart Selman
Department of Computer Science
University of Toronto
Abstract:
Commonsense knowledge is often incomplete, and reasoning with
incomplete information is generally computationally intractable.
For example, the information ``John may come by train or take a
plane'' can force a system to reason by cases. We show how plausible
default assumptions can be used to obtain more complete information
(by filling in details), thereby providing a computational advantage
in commonsense reasoning systems. Although it has been previously
hypothesized that default reasoning might provide such an advantage,
this is the first rigorous demonstration of the claim.
Model-preference default theories are defined to provide a general
framework for making default assumptions. We give a detailed analysis
of the tradeoff between expressiveness and tractability as we place
various syntactic restrictions on such theories. A similar analysis
is given for Reiter's default logic, with an emphasis on efficiently
computable default theories that include strict Horn theories.
Next, we consider the complexity of defeasible inheritance --- a more
specialized default reasoning formalism used in the representation
of hierarchically organized information in semantic networks. Our central
result is that inheritance reasoning based on Touretzky's inferential
distance is NP-hard. We again identify the source of the intractability
and delineate tractable subsystems.
Finally, the relationships between these complexity results are explored.
This analysis suggests that the various tractable default theories are
closely related, thereby providing an informal characterization of a
common core of efficiently computable default assumptions.
---------------------------------------------------------------
ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner
Qiang Yang
Computer Science Department.
University of Waterloo
(Joint work with Josh Tenenberg at Univ. of Rochester)
Abstract:
A considerable amount of research has been done in formalizing
intuitions regarding abstraction and the hierarchical problem solving
strategies that abstraction gives rise to. However, there has been
little work in extending these formal results from linear, STRIPS-like
planners to richer temporal planners, such as least-commitment
planners. In this talk, I describe the system ABTWEAK, which extends
the precondition-elimination abstraction of ABSTRIPS to hierarchical
planners using nonlinear plan representation as defined in TWEAK. I
show that ABTWEAK satisfies the Monotonic Property, whereby the
existence of a lowest level solution P implies the existence of a
highest level solution that is structurally similar to P. This
property enables a hierarchical planner to prune a considerable amount
of the search space without loss of completeness. I also show that it
is possible for a planner that is complete in one level of abstraction
to be incomplete across multiple levels of abstraction, and propose a
globally complete control strategy for ABTWEAK. Finally, I will
discuss how ABTWEAK can be used as a theoretical tool for comparing
some of the existing hierarchical planners.
--------------------------------------------------------------------
Title:
The Visualized Locus Method and the Direct Method
in Motion Analysis.
Speaker:
Dr. Masanobu Yamamoto, ETL, Japan and NRC, Canada.
Abstract:
This talk will review the development, at ETL Japan and NRC Canada, of
two approaches to the analysis of image sequences without need of
correspondence procedures between images. One is a visualized locus
method, similar to epipolar-plane image analysis, that has been
independently developed at ETL Japan. We will describe the history of
the method at ETL, e.g. monocular and stereoscopic tracking of bodies in
motion and acquisition of 3D structure from camera motion. Another
approach is based on an extension of the conventional direct method.
With this method one can estimate both rigid and nonrigid motion
parameters using a sequence of intensity and depth images given by a
video-rate range finder. In the discussion we will give the necessary
and sufficient conditions, namely a general aperture problem, so that
the method can uniquely determine the 3D rigid motion parameters.
__________________________________________________________________________
Within the letter of the law: planning in the legal domain
Kate Sanders
Brown University
Most work in AI and law has concentrated on modelling the type of
reasoning done by trial lawyers. In AI terms, this is plan evaluation
-- characterizing a sequence of actions that has already
been performed. In fact, most lawyers' work involves
planning -- for example, wills and trusts, real estate deals, and
business mergers and acquisitions. Certain planning issues, such as
the need to work with both rules and examples (statutes and cases), are
illustrated especially clearly in this domain.
In this talk, I set forth the requirements for a legal planning
system, place it in the context of past AI work in both law and
planning, and describe the design of CHIRON, a system that I am
developing in the domain of personal income tax planning.
------------------------------------------------------
ADDRESS:
All talks are at SRI International, 333 Ravenswood Avenue, Menlo Park,
California, Building E.
-------
∂20-Mar-90 1741 @Sunburn.Stanford.EDU:mary@patience.Stanford.EDU Seminar dates for potential CS faculty person
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Mar 90 17:41:49 PST
Received: from modesty.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07642; Tue, 20 Mar 90 17:42:16 -0800
Received: by modesty.stanford.edu (4.0/inc-1.5)
id AA10207; Tue, 20 Mar 90 17:36:52 PST
Date: Tue, 20 Mar 90 17:36:52 PST
From: mary@patience.Stanford.EDU (Mary Lombard)
Message-Id: <9003210136.AA10207@modesty.stanford.edu>
To: faculty@cs.stanford.edu
Subject: Seminar dates for potential CS faculty person
Cc: mary@patience.Stanford.EDU
To: Computer Science Faculty
From: Joe Oliger
Subject: April Visits of Applicants for the Scientific
Computing/Computational Math Program
The following seminar speakers are being considered for a faculty
position with the Scientific Computing/ Computational Math program.
13 April E. Meiburg
Will speak in the Applied Math Seminar at
3:30 in Bldg. 380, Room 380c
16 April I. Liang Chern
Will speak in Scientific Computing Seminar
at 4:15 in Bldg. 460, Room 352
20 April L. N. Trefethen
Will speak in the Applied Math Seminar at
3:30 in Bldg. 380, Room 380c
23 April L. Petzold
Will speak in Scientific Computing Seminar
at 4:15 in Bldg. 460, Room 352
All of these visitors will be here for the whole day. Please contact
Mary Lombard (3-0572 or mary@na-net) to schedule meetings with the
candidates during the day, if you are interested.
∂21-Mar-90 0321 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM Euler numbers
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 21 Mar 90 03:21:44 PST
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 493029; 21 Mar 90 05:53:23 EST
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 120038; Wed 21-Mar-90 02:52:58 PST
Date: Wed, 21 Mar 90 02:50 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: Euler numbers
To: ACW@YUKON.SCRC.Symbolics.COM
cc: Math-Fun@YUKON.SCRC.Symbolics.COM, "rcs@msri.org"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"hul@psuvm.psu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900320202150.7.ACW@WHIMBREL.SCRC.Symbolics.COM>
Message-ID: <19900321105023.2.RWG@TSUNAMI.SPA.Symbolics.COM>
Character-Type-Mappings: (1 0 (NIL 0) (NIL SAGE::GREEK NIL) "HIPPO12")
Fonts: CPTFONT, HIPPO12
Date: Tue, 20 Mar 90 15:21 EST
From: Allan C. Wechsler <ACW@YUKON.SCRC.Symbolics.COM>
The Encyclopedic Dictionary of Mathematics was remarkably obscure about
the Euler numbers, but I think I managed to decode what they said in
their article on generating functions.
Gosper, can you look at this and see if it is right? It agrees with
EDM's table for the first four.
(defvar *euler-array* (make-array '(400 400)))
(defun euler (n &optional (m 0))
(cond ((or (< n m) (< m 0)) 0)
((= n m 0) 1)
(t (or (aref *euler-array* n m)
(setf (aref *euler-array* n m)
(+ (* m (euler (- n 1) (- m 1)))
(* (+ m 1) (euler n (+ m 1)))))))))
That's them, but ugly. Modern convention has them alternating
with 0, and with alternating sign.
(C886) makelist(euler(n),n,0,10);
(D886) [1, 0, - 1, 0, 5, 0, - 61, 0, 1385, 0, - 50521]
Just like the Bernoullis, with which they are intimately connected.
The most familiar application is in summing
1↑n - 2↑n + 3↑n - ... (-)↑k (k+1)↑n.
The factorial generating function is just sech(z), which is why
they're sometimes called secant numbers. If you punt the signs,
(C866) TAYLOR(SEC(X),X,0,8);
2 4 6 8
X 5 X 61 X 277 X
(D866)/T/ 1 + -- + ---- + ----- + ------ + . . .
2 24 720 8064
(C869) SUBST(1,X,ARGS(D866));
1 5 61 277
(D869) [1, -, --, ---, ----]
2 24 720 8064
(C870) %*MAKELIST((2*N)!,N,0,4);
(D870) [1, 1, 5, 61, 1385]
Punting the signs invalidates a lot of formulas in Abramowitz &
Stegun, p 804+, (much better, apparently, than EDM), but is tempting
because the absvals have a neat combinatorial interpretation, which
I forget, but I think is in Knuth Vol 3, which I mislaid. (Fight
Alzheimer's with a checkup . . . . and a checkup.)
Speaking of Knuth, recall
Date: Wed, 1 Mar 89 03:27 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: 1,1,5,61,1385,50521,2702765,199360981,19391512145,...
To: "DEK@SAIL.Stanford.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
cc: "jmc@SAIL.Stanford.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, math-fun@RUSSIAN.SPA.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "igor@wri.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"dhb@ew11.nas.nasa.gov"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Date: Thu, 8 Dec 88 21:55 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Date: 08 Dec 88 1125 PST
From: Don Knuth <DEK@SAIL.Stanford.EDU>
I just saw your note about Bailey and Gregory. By now you have surely
recognized the Euler numbers (coefficients of sec z, not counting
factorials).
I missed it!
I computed the first 160 of them on a Turing machine,
more or less, in the 60s, and published them in Math Comp 21 (1967)
657--677.
Tnx!
This leaves the question of why are the Euler numbers hiding in the tail of
the Gregory (arctan(1)) series. I.e., starting with the nth term, putting
z = 1/n, the linear transformation of the tail becomes
1 Z 2 Z 3 Z
----- (1 + ------- (1 + ------- (1 + ------- (1 + . . .,
1 + Z 1 + 3 Z 1 + 5 Z 1 + 7 Z
which formally TAYLORs to
2 4 6 8
1 - Z + 5 Z - 61 Z + 1385 Z + . . ..
This is pretty strange. The former series converges for all Z
except the poles, while the latter converges nowhere. Also, the
latter is an even function, while the former has poles only for
some negative rationals. Serves us right for trying to expand
at an essential singularity (accumulation point of poles at 0).
The kth partial sum of the former, however, is a rational function
with radius of convergence 1/(2k+1), and determines the Euler
numbers thru k-1.
This was re the phenomenon that
1 1 1 1
2 (- - - + - - ... - ---) differs from pi/2 by
1 3 5 999
.001000000000005000000...
-.000000001000000000061..., so that there are bursts of correct
digits following occasional incorrect ones.
Eulers are normally computed painfully via a full-history recurrence,
but at the June MIT conf, I gave a "linear" formula, equivalent to
(C867) EULEM(K):=PRUD(MATRIX([(J-K-1)/(J+1)/2, 1 , 0 ],
[ 0, -1/2, (2*J-2*K-3)↑K],
[ 0, 0, 1/2 ]),
J,0,K+1)$
where prud is just Prod for matrices.
(C868) MAKELIST(EULEM(K),K,0,8);
[ 0 - 1 1 ] [ 0 1 0 ] [ 0 - 1 - 1 ] [ 0 1 0 ]
[ ] [ ] [ ] [ ]
[ 1 ] [ 1 3 ] [ 1 ] [ 1 485 ]
[ 0 - 0 ] [ 0 - - - - ] [ 0 -- 4 ] [ 0 - -- - --- ]
(D868) [[ 4 ], [ 8 4 ], [ 16 ], [ 32 16 ],
[ ] [ ] [ ] [ ]
[ 1 ] [ 1 ] [ 1 ] [ 1 ]
[ 0 0 - ] [ 0 0 - ] [ 0 0 -- ] [ 0 0 -- ]
[ 4 ] [ 8 ] [ 16 ] [ 32 ]
[ 0 - 1 5 ] [ 0 1 0 ] [ 0 - 1 - 61 ]
[ ] [ ] [ ]
[ 1 621 ] [ 1 255367 ] [ 1 ]
[ 0 -- --- ] [ 0 - --- - ------ ] [ 0 --- 61771 ]
[ 64 2 ], [ 128 64 ], [ 256 ],
[ ] [ ] [ ]
[ 1 ] [ 1 ] [ 1 ]
[ 0 0 -- ] [ 0 0 --- ] [ 0 0 --- ]
[ 64 ] [ 128 ] [ 256 ]
[ 0 1 0 ] [ 0 - 1 1385 ]
[ ] [ ]
[ 1 286776009 ] [ 1 372864325 ]
[ 0 - --- - --------- ] [ 0 ---- --------- ]
[ 512 256 ], [ 1024 16 ]]
[ ] [ ]
[ 1 ] [ 1 ]
[ 0 0 --- ] [ 0 0 ---- ]
[ 512 ] [ 1024 ]
where the Eulers appear in the upper right element. Conventional
notation for what these matrices compute requires a double sum,
which is very misleading, computational-complexitywise. (Actually,
I gave a formula with an additional parameter r, which gave Euler[k]
for all integer r>k !)
Here's a very little known connection with negapolylogs.
(C881) LI[1](X);
(D881) - LOG(1 - X)
(C884) LI[0](X):=''(x*diff(li[1](x),x));
X
(D881) LI (X) := -----
0 1 - X
(D882) NLI (X) := IF N = 0 THEN LI (X) ELSE BLOCK([NEGDISTRIB : FALSE],
N 0
X SUBST(- (1 - X), X - 1, FACTOR(DIFF(NLI (X), X))))
N - 1
(C883) MAKELIST(NLI[N](X),N,0,4);
2 2
X X X (X + 1) X (X + 4 X + 1) X (X + 1) (X + 10 X + 1)
(D883) [-----, --------, ---------, ----------------, -------------------------]
1 - X 2 3 4 5
(1 - X) (1 - X) (1 - X) (1 - X)
In other words, each one is just x times the derivative of the previous.
The triangle 1, 1 1, 1 4 1, 1 11 11 1, ... is known as the Eulerian numbers,
which pedagogues normally take pains to distinguish from Euler numbers, but
(C886) MAKELIST(RECTFORM(NLI[N](\i)-NLI[N](-\i)),N,0,8);
(D884) [i, 0, - i, 0, 5 i, 0, - 61 i, 0, 1385 i]
(where \i = sqrt(-1).)
I suspect that there is an asymptotic formula involving n↑(n/ε1gε0).
Gosper?
Interesting guess. From A&S: 2↑(n+2) n!/pi↑(n+1)
My religious conviction that all formulas containing Bernoulli
numbers can be generalized by substituting Bernoulli polynomials
in a new variable extends to Euler numbers and Euler polynomials,
but I have not had the time to amass as much evidence. (I vaguely
remember seeing an Euler (vs Bernoulli) variation on the Euler
MacLaurin summation formula, perhaps from Matiyasyevich, but
fight Alzheimer's...). Say, maybe Euler was German for Smith or
Jones, and there were something like thirty five guys named Euler...
Euler[s] and eulerpoly[s](x) presumably have a continuous (on s)
generalization in terms of the Hurwitz zeta function
zeta(s,a) := a↑-s + (a+1)↑-s + (a+2)↑-s + ...,
just like the bernpolys.
∂21-Mar-90 0801 chandler@Sunburn.Stanford.EDU 3/20 Meeting of the Tenured CS Faculty
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Mar 90 08:01:12 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA12739; Wed, 21 Mar 90 08:02:20 -0800
Date: Wed, 21 Mar 1990 8:02:19 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: cheriton@cs.Stanford.EDU, golub@cs.Stanford.EDU, manna@cs.Stanford.EDU,
mccarthy@cs.Stanford.EDU
Cc: tenured@cs.Stanford.EDU, chandler@Sunburn.Stanford.EDU
Subject: 3/20 Meeting of the Tenured CS Faculty
Message-Id: <CMM.0.88.638035339.chandler@Sunburn.Stanford.EDU>
The senior faculty met on Tuesday, March 20, 1990 to vote on a candidate for
the position of (possibly Associate) Professor (Teaching). After much
discussion and a rather complex voting process, the faculty narrowly decided
that its first choice was Eric Roberts. Thereupon, Nils asked for a vote on
approval or disapproval of Eric Roberts. The faculty voted for approval.
Since you have not yet voted on this matter, could you please send me your
vote either: a) for approval of Eric; b) against approval of Eric; or c)
abstain. (If you are interested in the tally of approval/disapproval/abstain
at the faculty meeting, please drop by my office.) It is important for me to
have your vote as soon as possible.
Thanks much.
Joyce
∂21-Mar-90 1204 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Mathematical Foundations of Database & Knowledge Base Systems
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Mar 90 12:04:38 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02909; Wed, 21 Mar 90 12:04:48 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26909; Wed, 21 Mar 90 12:02:30 -0800
Message-Id: <9003212002.AA26909@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7096; Wed, 21 Mar 90 13:58:35 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7074; Wed, 21 Mar 90 13:58:32 CST
Date: Wed, 21 Mar 90 13:57:18 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Ron Fagin <FAGIN@ALMADEN.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Ron Fagin <FAGIN%ALMADEN.BITNET@VM1.NoDak.EDU>
Subject: Mathematical Foundations of Database & Knowledge Base Systems
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
Third International Symposium on
Mathematical Fundamentals of Database and Knowledge Base Systems
MFDBS-91
Goehren, GDR, May 5-10, 1991
The conference will cover new developments in theoretical aspects of
database and knowledge base systems and the design of databases and
knowledge bases. Papers presenting original research in database and
knowledge base theory and applications of database theory are sought.
Some suggested, although not exclusive topics of interest are:
database and knowledge base systems;
logical, algebraic and combinatorial fundamentals of database theory
and design of databases;
theories for knowledge bases;
object-oriented databases and object-oriented modelling;
fundamentals of query languages, transaction processing, distributed
databases, concurrency control, access strategies, recovery,
security, privacy, safety;
fundamentals for integrity constraints and consistency in databases
and knowledge bases;
fundamentals of database technology;
models for database and knowledge base machines;
models for user interfaces;
design and implementation of non-standard databases and of knowledge
bases.
You are invited to submit five copies of a detailed abstract (more
than four pages) or full draft paper (15 double-spaced typed pages
maximum) by October 25, 1990 to one of the Program Committee Chairs:
Janos Demetrovics, Computer and Automation Institute of the HAS,
H - 1502 Budapest, P.O.Box 63, Hungary
Bernhard Thalheim, Dept. of Computer Science, Rostock University,
DDR - 2500 Rostock, A.-Einstein-Str. 21, GDR
Program Committee
Serge Abiteboul (France), Georgio Ausiello (Italy), Paolo Atzeni (Italy)
Catriel Beeri (Israel), Joachim Biskup (FR Germany), Stefano Ceri(Italy)
Claude Delobel (France), Janos Demetrovics (Hungary), Ronald Fagin(USA),
Georg Gottlob (Austria), Detlev Gerhardt (E Germany), Stephen Hegner
(USA), Gyula Katona (Hungary), Maria Orlowska (Australia), Jan Paredaens
(Belgium), Antonin Riha (Czechoslovakia), J. W. Schmidt (FR Germany),
Marc Scholl (Switherland), Nicolas Spyratos (France), Anatolij Stognij
(USSR), Lew Tenembaum (USSR), Bernhard Thalheim (E Germany), Marianne
Winslett (USA), Michael Zalenko (USSR).
Proceedings of the conference will be published by Springer and will be
available at the conference.
For further information, contact Bernhard Thalheim (until June 1990 at:
Kuwait University, Dept. of Mathematics, P.O.B. 5969, 13060 Kuwait;
email: smaftb1 at kukun00; Tel.: (965) 4847 124).
∂21-Mar-90 1217 LOGMTC-mailer Decision problems for propositional linear logic
Received: from Iswim.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Mar 90 12:17:32 PST
Received: from LOCALHOST by Iswim.Stanford.EDU with SMTP (5.61/25-eef) id AA10244; Wed, 21 Mar 90 12:16:29 -0800
Message-Id: <9003212016.AA10244@Iswim.Stanford.EDU>
To: types@theory.lcs.mit.edu
Cc: logmtc@sail.Stanford.EDU
Subject: Decision problems for propositional linear logic
From: John C. Mitchell <jcm@cs.stanford.edu>
Reply-To: John C. Mitchell <jcm@cs.stanford.edu>
Date: Wed, 21 Mar 90 12:16:28 -0800
Sender: jcm@Iswim.Stanford.EDU
Decision problems for propositional linear logic
P. Lincoln, J. Mitchell, A. Scedrov, N. Shankar
We have been investigating several fragments of propositional linear
logic. Our main result is
1. Any fragment conservative over the intuitionistic linear logic
of tensor, plus, implication and ! (of course) is undecidable.
In particular, full propositional linear logic is conservative
over this fragment, and therefore undecidable. We know of at least
one prior claim of decidability.
The undecidability proof is by reduction from a form of alternating
counter machines. Our machines differ from the usual counter machines
in that we do not have an atomic "zero test" instruction. However,
these machines may simulate ordinary counter machines using "and"
branching to verify that a counter value is zero. We reduce these
machines to a form of "tensor, plus theory" (similar to the
tensor theories used by Gunter and Gehlot) and show that in the
intuitionistic linear logic of tensor, plus, implication and !
we may faithfully axiomatize a finite tensor, plus theory by
a single formula. The insight of using plus to express a form
of "and" branching is due to Pat Lincoln.
Although the proper formulation of full non-commutative linear logic
is not completely clear, we have considered the decision problem for
a seemingly natural formulation and obtained the following:
2. Noncommutative linear logic of tensor, implication and !
is undecidable.
This proof is a straightforward encoding of the word problem for
semigroups, although the soundness of this encoding is not completely
trivial. We also observe that the (commutative) linear logic of
implication, ! and second-order quantification is undecidable.
This follows from Girard's embedding of intuitionistic logic
into linear logic, and the Gabbay/Lob undecidability result for
quantified positive intuitionistic propositional logic.
We also have some complexity results for more limited
fragments of propositional linear logic. (All of these fragments
are quantifier-free.) For example:
3. Linear logic of tensor, par and negation is in NP.
4. Linear logic with all connectives (tensor, plus, par, with,
implies, negation) and logical constants (bottom, 0, top)
but without ! or ? is decidable in PSPACE.
We also remark that the fragment of tensor, implication and !
is EXP-space hard. This follows from the Asperti, Gunter,
Gehlot, Meseguer and Marti-Oliet correspondence between this
fragment and Petri nets, and the Mayr/Meyer result for nets.
Acknowledgement: We thank Alasdair Urquhart for communicating
prior results on the complexity of relevant implication (R ->),
and his recent Co-NP lower bound for propositional linear logic of
tensor, plus, negation, bottom, 0, 1 and top, and his
independent proof of the EXP-space lower bound for tensor,
implication and !. Thanks also to Carl Gunter for pointing
out the connection to Petri nets and to others who helpfully
responsed to our inquiry on this mailing list.
∂21-Mar-90 1236 LOGMTC-mailer MSRI Workshop Schedule, 3/26-3/30
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 21 Mar 90 12:36:19 PST
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA26013; Wed, 21 Mar 90 12:29:19 PST
Received: by msri.org (4.0/SMI-4.0)
id AA01279; Wed, 21 Mar 90 12:26:32 PST
Date: Wed, 21 Mar 90 12:26:32 PST
From: david@msri.org (David Mostardi)
Message-Id: <9003212026.AA01279@msri.org>
To: weekly@msri.org
Subject: MSRI Workshop Schedule, 3/26-3/30
Mathematical Sciences Research Institute
1000 CENTENNIAL DRIVE * BERKELEY,CA 94720 * (415) 642-0143
Workshop on Number Theory and Algorithms, March 26--29, 1990
Monday, March 26
9:30-10:30 Johannes Buchmann, Universitat Saarbrucken
On the computation of class groups
11-12 Henri Cohen, Universite de Bordeaux I
PARI, a computer algebra system for number theory
2:10-3:10 Jacques Martinet, Universite de Bordeaux I
On discriminants, regulators and class groups
3:45-4:45 Rene Schoof, Rijksuniversiteit Utrecht
Kolyvagin's work on class groups of cyclotomic fields
Tuesday, March 27
9:30-10:30 Jeremy Teitelbaum, University of Michigan
Computation of p-adic periods
11-12 Jean-Francois Mestre, Universite de Paris VII
Generalized arithmetic geometric mean algorithms
2:10-3:10 Barry Mazur, Harvard University
Finding and computing modular eigenforms of high weight
3:45-4:45 Armand Brumer, Fordham University
The behavior of Mordell-Weil groups of elliptic curves
Wednesday, March 28
9:30-10:30 Victor Shoup, AT\&T Bell Laboratories
Algorithms for finite fields
11-11:30 Wieb Bosma, University of Sydney
Primality testing with finite rings
11:30-12 Francois Morain, I.N.R.I.A.
Primality testing with elliptic curves
2:10-3:10 Dennis A. Hejhal, Institute for Advanced Study, University of Minnesota
Computational aspects of the Selberg trace formalism
3:45-4:45 Hendrik Lenstra, University of California, Berkeley
Factoring integers in the dark ages
Thursday, March 29
9:30-10:30 Arjen Lenstra, Bell Communications Research
Factoring integers with the number field sieve
11-12 Joe Buhler, Reed College
The number field sieve for general integers
2:10-2:40 Andrew Odlyzko, AT\&T Bell Laboratories
Solving sparse linear systems over finite fields
2:40-3:10 Dan Gordon, University of Georgia & Sandia National Laboratories
Discrete logarithms with the number field sieve
3:45-4:45 Carl Pomerance, University of Georgia
A rigorous time bound for factoring integers
∂21-Mar-90 1429 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ICALP 91 - Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Mar 90 14:29:14 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13348; Wed, 21 Mar 90 14:29:16 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06867; Wed, 21 Mar 90 14:29:21 -0800
Message-Id: <9003212229.AA06867@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5008; Wed, 21 Mar 90 15:54:51 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4997; Wed, 21 Mar 90 15:54:46 CST
Date: Wed, 21 Mar 90 15:53:44 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"Moshe Y. Vardi" <VARDI@ALMADEN.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "Moshe Y. Vardi" <VARDI%ALMADEN.BITNET@VM1.NoDak.EDU>
Subject: ICALP 91 - Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I C A L P 9 1
July 8-12, 1991 - Universidad Complutense Madrid Spain
18th International Colloquium on Automata, Languages and
Programming
The annual meeting of the European Association
for Theoretical Computer Science (EATCS)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
C A L L F O R P A P E R S
TOPICS
All areas of theoretical computer science, including (but not
restricted to): Computability, automata, formal languages,
analysis of algorithms, computational complexity, data types and
data structures, theory of data bases and knowledge bases,
semantics of programming languages, program specification,
transformation and verification, foundations of logic and
functional programming, theory of logical design and layout,
parallel and distributed computation, theory of concurrency,
symbolic and algebraic computation, term rewriting systems,
computational geometry, cryptography, theory of robotics.
PAPERS
Authors are invited to submit seven copies (preferably no more
than 12 pages long) of an extended abstract or draft of a full
paper before November 15, 1990 to:
Prof. Mario Rodriguez Artalejo
Departamento de Informatica y Automatica
Facultad de Matematicas
Universidad Complutense
Av. Complutense s/n
28040 Madrid, Spain
Telex: 41802 UCMAT E
Telefax: 341 2439489
E-mail: W450@EMDUCM11.BITNET
Persons submitting papers from countries in which access to
copying machines is difficult may submit a single copy.
PROGRAMME COMMITTEE
K.R. Apt, Amsterdam, the Netherlands,
and Austin, Texas, U.S.A.
A. Arnold, Bordeaux, France
J. Hromkovic, Bratislava, Czechoslovakia
N.D. Jones, Copenhagen, Denmark
J. Karhumaeki, Turku, Finland
W. Kuich, Vienna, Austria
R.T. Leighton, Cambridge MA., U.S.A.
A. Lingas, Lund, Sweden
B. Monien, Paderborn, W.Germany (Co-chairman)
U. Montanari, Pisa, Italy
F. Orejas, Barcelona, Spain
M. Paterson, Coventry, Great Britain
A. Pnueli, Rehovot, Israel
M. Rodriguez Artalejo, Madrid, Spain (Co-chairman)
J.R. Sack, Ottawa, Canada
M. Vardi, San Jose, U.S.A.
U. Vishkin, Tel Aviv, Israel, and Maryland, U.S.A.
P. Wolper, Liege, Belgium
ORGANIZING COMMITTEE
M. Bradley Delso
M.I. Fernandez Camacho
D. de Frutos Escrig
A. Gavilanes Franco
A. Gil Luezas
M.T. Hortala Gonzalez
J. Leach Albert (Chairman)
S. Nieva Soto
Yolanda Ortega Mallen
With the cooperation of
Asociacion de Tecnicos de Informatica ATI
DATES
Deadline for submission: November 15, 1990
Notification of acceptance
/rejection: 1st week February, 1991
Deadline for final text: April 1, 1991
Conference: July 8-12, 1991
LOCATION
Madrid began its history as a small Muslim village in the 9th
century and became Spain's capital under Philip II in the 16th
century. Today, this village is a very friendly and open city that
has been worthy enough to be named the European Cultural Capital
for 1992.
The lectures will take place in lecture rooms that are located on
the campus. Accommodation will be offered in student's dormitories
on the campus, as well as in several hotels in the city, with a
good connection to the campus by bus and underground.
Participants will enjoy a sunny weather and find a rich offer in
art, shopping and gastronomy. The Prado Museum, a world famous
pinacoteque; the Royal Palace, the Retiro Park and many other
things in Madrid are worth visiting. There is also plenty to see
on day outings from the city - from the Palace and Monastery of El
Escorial, to Segovia, with its famous Roman aquaduct and ancient
churches, or the old and beautiful historical town of Toledo.
FURTHER INFORMATION
Further details about the conference (and the final programme)
will be sent to all those who have submitted a paper, to all EATCS
members and to all interested who write to:
ICALP 91
Prof. Javier Leach Albert
Departamento de Informatica y Automatica
Facultad de Matematicas
Universidad Complutense
Av. Complutense s/n
28040 Madrid, Spain
Telex: 41802 UCMAT E
Telefax: 341 2439489
E-mail: ICALP91@EMDUCM11.BITNET
∂21-Mar-90 1442 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU 1990 ACM STOC Program
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Mar 90 14:41:47 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA14368; Wed, 21 Mar 90 14:41:40 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07230; Wed, 21 Mar 90 14:35:48 -0800
Message-Id: <9003212235.AA07230@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5183; Wed, 21 Mar 90 15:58:35 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5165; Wed, 21 Mar 90 15:58:20 CST
Date: Wed, 21 Mar 90 15:56:47 CST
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Rao Kosaraju <kosaraju@crabcake.cs.jhu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Rao Kosaraju <kosaraju%crabcake.cs.jhu.edu@VM1.NoDak.EDU>
Subject: 1990 ACM STOC Program
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
TWENTY-SECOND ANNUAL
ACM SYMPOSIUM ON
THEORY OF COMPUTING
Sponsored by ACM SIGACT
Baltimore, Maryland
May 14-16, 1990
Local Arrangements Chair:
S. Rao Kosaraju
Program Committee Chair:
Harold Gabow
Program Committee:
Baruch Awerbuch S. Rao Kosaraju
Bernard Chazelle Dexter Kozen
Fan Chung Ian Munro
Ronald Fagin John Reif
Harold Gabow Janos Simon
Oded Goldreich Manfred Warmuth
STOC '90
REGISTRATION FORM
Category Fee Late Fee
(after 4/13)
ACM or SIGACT Member $230 $280
Neither ACM nor SIGACT Member $280 $330
Author or Program Committee Member $220 $270
Full-time Student $ 60 $110
Specify your membership number ___________________________________________
Registration fee includes: reception, 3 lunches, dinner cruise, coffee
breaks, and the proceedings.
Student registration fee includes: reception, lunches, coffee breaks
and proceedings, but not the dinner cruise.
Non-members can join SIGACT for free by checking the following line.
(A portion of your registration fee covers your first year's dues.)
Students can also get free ACM student membership.
_____ Please enroll me as a SIGACT member.
_____ I am a student; enroll me as an ACM student member also.
Additional dinner cruise tickets are $37 each.
Name: _______________________________________________________________
Affiliation: ________________________________________________________
Address: ____________________________________________________________
_____________________________________________________________________
Phone number: ______________________________E-mail: _________________
Dietary Restrictions: ___ Kosher ___ Vegetarian
Fill out the above registration form and mail with check to:
ACM STOC '90
c/o S. Rao Kosaraju
Department of Computer Science
The Johns Hopkins University
Baltimore, Maryland 21218
STOC '90
HOTEL RESERVATION FORM
May 14-16, 1990
Omni Inner Harbor Hotel
(30l)752-1100
Please circle the accommodation desired.
Single $ 98
Double $108
Triple $124
Quadruple $140
Name: ______________________________________________________________
Sharing with: ______________________________________________________
Affiliation: _______________________________________________________
Address: ___________________________________________________________
____________________________________________________________________
Day time phone number:______________________________________________
Arrival Date:__________________Arrival Time: _______________________
Departure Date: _______________Departure Time: _____________________
Arrivals after 6:00 pm must guarantee first nights accommodations with
check, money order, or major credit card.
Credit card company: _______________________________________________
Card number: _______________________________________________________
Expiration date: ____________________________________________________
Signature: _________________________________________________________
Send this form to:
Omni Inner Harbor Hotel
101 W.Fayatte Street
Baltimore, Maryland 21201
Reservations received after the contracted block of rooms is full or
after the cut-off date of April 13, 1990 are subject to space and rate
availability.
PROGRAM
All events except the dinner cruise are held at the Omni Hotel.
Reception, all technical sessions, and the business meeting will be
held in the Grand Ballroom on the first floor. During the day
Mencken Room on the first floor is available for small meetings.
Sunday Evening, May 13, 1990
8:00-11:00 Reception
Monday, May 14, 1990
Session 1 8:30-10:10
Chaired by Ian Munro, University of Waterloo
8:30 BLASTING Through the Information Theoretic Barrier with FUSION
TREES Michael L. Fredman, Rutgers, Bellcore and UCSD; Dan E.
Willard, SUNY at Albany.
8:50 On the Dynamic Finger Conjecture for Splay Trees Richard Cole,
Courant Institute.
9:10 Unique Binary Search Tree Representations and Equality-testing
of Sets and Sequences Rajamani Sundar, Courant
Institute; Robert E. Tarjan, Princeton University
and AT&T Bell Laboratories.
9:30 The Information Theory Bound is Tight for Selection in a Heap
Greg N. Frederickson, Purdue University.
9:50 Lower Bounds for the Union-find and the Split-find Problem on
Pointer Machines J. A. La Poutr'e, University of Utrecht.
Break 10:10-10:30
Session 2 10:30-12:10
Chaired by Manfred Warmuth, University of California, Santa Cruz
10:30 Optimal Randomized Algorithms for Local Sorting and Set-maxima
Wayne Goddard, Leonard Schulman, Massachusetts Institute
of Technology; Valerie King, University of Toronto.
10:50 On the Necessity of Occam Algorithms Raymond Board, Leonard
Pitt, Univesity of Illinois, Urbana.
11:10 Learning Boolean Functions in an Infinite Attribute Space
Avrim Blum, Massachusetts Institute of Technology.
11:30 Self-testing and Self-correcting Programs with Applications to
Numerical Problems Manuel Blum, Ronitt Rubinfeld, University of
California, Berkeley; Michael Luby, International Computer
Science Institute.
11:50 Coherent Functions and Program Checkers Andrew C.Yao,
Princeton University.
Lunch 12:10-1:30
Session 3 1:30-3:10
Chaired by Baruch Awerbuch, M.I.T.
1:30 The Use of a Synchronizer Yields Maximum Computation Rate in
Distributed Networks Shimon Even, Technion; Sergio Rajsbaum,
University of Texas at Dallas.
1:50 The Wakeup Problem Michael J. Fischer, Gadi Taubenfeld,
Yale University; Shlomo Moran, Technion; Steven Rudich, Carnegie
Mellon University.
2:10 How to Distribute a Dictionary in a Complete Network Martin
Dietzfelbinger, Friedhelm Meyer auf der Heide, University of Paderborn.
2:30 Computing with Unreliable Information Uriel Feige, David
Peleg, Weizmann Institute of Science; Prabhakar Raghavan, IBM
T.J. Watson Research Center; Eli Upfal, IBM
Almaden Research Center and Weizmann.
2:50 Efficient Robust Parallel Computations Zvi M. Kedem,Courant
Institute; Krishna Palem, IBM T.J. Watson Research Center; Paul
Spirakis, Patras University and Courant.
Break 3:10-3:30
Session 4 3:30-5:10
Chaired by John Reif, Duke University
3:30 On-line Algorithms for Path Selection in Nonblocking Networks
Sanjeev Arora, Tom Leighton, Bruce Maggs, Massachusetts
Institute of Technology.
3:50 Optimal Disk I/O with Parallel Block Transfer Jeffrey S.
Vitter, Brown University; Elizabeth A.M. Shriver, Bell
Communications Research.
4:10 Deterministic Sampling - A New Technique for Fast Pattern
Matching Uzi Vishkin, University of Maryland and Tel Aviv University.
4:30 Towards Overcoming the Transitive-closure Bottleneck: Efficient
Parallel Algorithms for Planar Digraphs Ming-Yang Kao, Duke
University; Philip N. Klein, Brown University.
4:50 Deterministic Sorting in Nearly Logarithmic Time on the
Hypercube and Related Computers Robert Cypher, IBM Almaden
Research Center; C. Greg Plaxton, Massachusetts
Institute of Technology.
8:30-11:00 SIGACT Business Meeting
Tuesday, May 15, 1990
Session 5 8:30-10:00
Chaired by Dexter Kozen, Cornell University
8:30 Pseudorandom Generators for Space-bounded Computation
Noam Nisan, Massachusetts Institute of Technology.
8:50 Small-bias Probability Spaces: Efficient Constructions and
Applications Joseph Naor, Stanford University; Moni Naor, IBM
Almaden Research Center.
9:10 The Analysis of Closed Hashing Under Limited Randomness
Jeanette P. Schmidt, Polytechnic University, Brooklyn; Alan
Siegel, Courant Institute.
9:30 The Computational Complexity of Universal Hashing Yishay
Mansour, Noam Nisan, Massachusetts Institute of
Technology; Prasoon Tiwari, IBM T.J. Watson Research Center.
9:50 Not All Keys Can Be Hashed in Constant Time Joseph Gil, Avi
Wigderson, Hebrew University; Friedhelm Meyer auf der
Heide, University of Paderborn.
Break 10:10-10:30
Session 6 10:30-12:10
Chaired by Janos Simon, University of Chicago
10:30 A Technique for Lower Bounding the Cover Time David
Zuckerman, University of California, Berkeley.
10:50 Approximate Inclusion-exclusion Nati Linial, IBM Almaden
Research Center, Stanford University, Hebrew University; Noam
Nisan, Massachusetts Institute of Technology.
11:10 Towards Optimal Simulations of Formulas by Bounded-width
Programs Richard Cleve, International Computer Science Institute.
11:30 Functions with Bounded Symmetric Communication Complexity and
Circuits with mod m Gates Mario Szegedy, Hebrew University.
11:50 Monotone Circuits for Matching Require Linear Depth Ran Raz,
Avi Wigderson, Hebrew University.
Lunch 12:10-1:30
Session 7 1:30-3:30
Chaired by Bernard Chazelle,Princeton University
1:30 A Separator Theorem for Graphs with an Excluded Minor and Its
Applications Noga Alon, IBM Almaden Research Center; Paul
Seymour, BellCore; Robin Thomas, Georgia Institute of Technology.
1:50 Separators in Two and Three Dimensions Gary L. Miller, Carnegie
Mellon University and University of Southern California;
William Thurston, Princeton University.
2:10 Leighton-Rao Might be Practical: A Faster Approximation
Algorithm for Uniform Concurrent Flow Philip Klein, Brown
University; Clifford Stein, Massachusetts Institute of
Technology; Eva Tardos, Cornell University.
2:30 Output-sensitive Construction of Voronoi Diagrams in Rd of
Order 1 to k Ketan Mulmuley, University of Chicago.
2:50 Solving Query-retrieval Problems by Compacting Voronoi Diagrams
Alok Aggarwal, IBM T.J. Watson Research Center and
Massachusetts Institute of Technology; Mark Hansen,
Tom Leighton, MIT.
3:10 Quantitative Steinitz's Theorems with Applications to
Multifingered Grasping David Kirkpatrick, University of British
Columbia; Bud Mishra, Chee-Keng Yap, Courant Institute.
Break 3:30-3:50
Session 8 3:50-5:10
Chaired by Harold Gabow, University of Colorado at Boulder
3:50 An Optimal Algorithm for On-line Bipartite Matching Richard M.
Karp, University of California, Berkeley and International
Computer Science Institute; Umesh V. Vazirani,
University of California, Berkeley; Vijay V. Vazirani, Cornell
University.
4:10 Online Algorithms for Locating Checkpoints M. Bern, D.
Greene, Xerox PARC; A. Raghunathan, Courant Institute; M.
Sudan, University of California, Berkeley.
4:30 Random Walks on Weighted Graphs, and Applications to On-Line
Algorithms Don Coppersmith, Prabhakar Raghavan, Marc Snir,
IBM T.J. Watson Research Center; Peter Doyle, AT&T Bell Laboratories.
4:50 On the Power of Randomization in Online Algorithms A.
Borodin, University of Toronto;
R. Karp, University of California, Berkeley and
International Computer Science Institute;
G. Tardos, Eotvos University; A. Wigderson, Hebrew University.
6:15-10:00 Dinner cruise on Bay Lady, Harbor Place
Wednesday, May 16, 1990
Session 9 8:30-10:10
Chaired by Oded Goldreich, Technion
8:30 One-way Functions are Necessary and Sufficient for Secure
Signatures John Rompel, Massachusetts Institute of Technology.
8:50 Pseudo-Random Generators under Uniform Assumptions Johan
Hastad, Royal Institute of Technology, Stockholm.
9:10 The Discrete Log is Very Discreet A.W. Schrift, A. Shamir,
Weizmann Institute of Science.
9:30 Witness Indistinguishability and Witness Hiding U. Feige, A.
Shamir, Weizmann Institute of Science.
9:50 Public-key Cryptosystems Provably Secure Against Chosen
Ciphertext Attacks, Moni Naor, IBM Almaden Research Center;
Moti Yung, IBM T.J. Watson Research Center.
Break 10:10-10:30
Session 10 10:30-12:10
Chaired by Ronald Fagin, IBM Almaden
10:30 On the Complexity of Local Search Christos H.
Papadimitriou, University of California, San Diego; Alejandro
A. Schaffer , Rice University; Mihalis Yannakis, AT&T Bell
Laboratories.
10:50 Quantifiers and Approximation Alessandro Panconesi, Desh
Ranjan, Cornell University.
11:10 On Polynomial Bounded Truth-Table Reducibility of NPSets to
Sparse Sets Mitsunori Ogiwara, Osamu Watanabe, Tokyo Institute
of Technology.
11:30 The Undecidability of the Semi-unification Problem A.J. Kfoury,
Boston University; J. Tiuryn, P. Urzyczyn, University of Warsaw.
11:50 Decidability of the Multiplicity Equivalence of Multitape
Finite Automata T.Harju, J. Karhumaki, University of Turku.
Lunch 12:10-1:30
Session 11 1:30-2:50
Chaired by Oded Goldreich, Technion
1:30 Perfect Zero-knowledge in Constant Rounds Mihir Bellare, Silvio
Micali, Rafail Ostrovsky, Massachusetts Institute of Technology.
1:50 The (True) Complexity of Statistical Zero Knowledge Mihir
Bellare, Silvio Micali, Rafail Ostrovsky, Massachusetts
Institute of Technology.
2:10 Cryptographically Secure Distributed Computation in a Constant
Number of Rounds Donald Beaver, Harvard University; Silvio
Micali, Phillip Rogaway, Massachusetts Institute of Technology.
2:30 Efficient Computation on an Oblivious RAM Rafail Ostrovsky,
Massachusetts Institute of Technology.
Break 2:50-3:10
Session 12 3:10-4:50
Chaired by Fan R. K. Chung, Bellcore
3:10 Computing in Quotient Groups William M. Kantor, Eugene M.
Luks, University of Oregon.
3:30 On the Decidability of Sparse Univariate Polynomial
Interpolation Allan Borodin, University of Toronto; Prasoon
Tiwari, IBM T.J.Watson Research Center.
3:50 Small Degree Primitive Roots over Finite Fields Victor
Shoup, AT&T Bell Laboratories.
4:10 On the Complexity of Computing a Grobner Basis for the Radical
of a Zero Dimensional Ideal Y. N. Lakshman, Rensselaer
Polytechnic Institute.
4:30 The Number Field Sieve A.K. Lenstra, Bellcore; H.W. Lenstra,
Jr., University of California, Berkeley; M.S. Manasse, DEC SRC;
J.M. Pollard, Tidmarsh, Reading.
GENERAL INFORMATION
CONFERENCE REGISTRATION:
There will be registration outside of the Grand Ballroom on Sunday,
May 13, from 8:00 to 10:00 pm. From Monday to Wednesday there will be a
registration and information desk set up outside the Grand Ballroom
from 8:30 am to 5:00 pm.
HOTEL INFORMATION:
The conference will be held at the Omni Inner Harbor Hotel,
Baltimore, which is conveniently located downtown in Charles Center,
two blocks from the Convention Center and Festival Hall, directly
across from the Baltimore Arena and connected to the Inner Harbor by
overhead walkways. A block of rooms is being held for the symposium
until the cut-off date, April 13, 1990. The symposium rate will be
honored up to three days prior to the symposium. Reservations received after
the block of rooms is full or after cut-off date are subject to space
and rate availability. Check-in time is 3:00pm and check-out time is
12:00 noon.
Child Care: Child care service is available; please contact the
concierge at (301) 385-6795.
TRANSPORTATION:
If you are flying you will arrive at Baltimore-Washington
International (BWI) Airport which is about 15 miles south of downtown
Baltimore. The BWI Shuttle (van) leaves the airport every
1/2 hour from outside the baggage claim area to the Omni at a one-way
cost of $5.75 or round-trip cost of $10.00. A taxi to Omni costs about
$13.00. (Flying to National Airport or Dulles Airport
is not recommended; however,there is limo/bus service connecting to BWI.)
To reach the hotel by car going south on I-95: through Fort McHenry
Tunnel, to 395 N(Exit 53) 1/2 mile to Pratt Street, turn right; two
blocks to Charles Street, turn left; four blocks to Fayette
Street, turn left; Omni is one block on the left. Going north on I-95;
take exit 53,395 N; 1/2 mile to Pratt Street, turn right; continue as
above. Going south on I-83 from 695: Go to end of expressway; turn
right at Fayette Street; Omni is 7 blocks on the left Going north on
Baltimore-Washington Parkway: becomes Russell Street; turn right onto
Pratt Street; go 5 blocks and turn left onto Charles Street; 4 blocks
and turn left onto Fayette Street; Omni is one block ahead on left.
The parking fee at the hotel, with hotel receipt, is $7.00 per day.
AIRLINE INFORMATION:
USAir has been designated the official carrier of STOC '90. This
special fare will offer a 40% discount off the standard round trip day
coach fare for travel within the Continental U.S. From within Canada,
USAir will allow 30% discount with no minimum stay requirement or a
35% discount with a 2 night minimum stay requirement. Additional
restrictions apply for discounts in international travel. These fares
are valid between May 11-19, 1990. To obtain this convention
discount, you or your travel agent must call US Air 1-800-334-8644; from
Canada 1-800-428-4322, Ext. 7702; and refer to Gold File No. 168555.
INFORMATION ABOUT BALTIMORE:
Baltimore has undergone a tremendous revitalization in recent
years. Baltimore's new showplace is the Inner Harbor area, where you
will find boutiques and cafes, as well as the National Aquarium,
Maryland Science Center, and the Pier 6 Concert Pavilion. Throughout
the summer the city sponsors Ethnic Festivals of every description,
culminating in a grand City Fair. Its historic sites include Fort
McHenry, the Edgar Allen Poe House, and the first frigate of the U.S.
Navy, the U.S.F. Constellation. The Baltimore Museum of Art, adjacent
to the Homewood campus of The Johns Hopkins University, and the
Walters Art Gallery, both house excellent permanent collections and
attract important traveling exhibitions. Other cultural facilities and
attractions include the Baltimore Symphony Orchestra, Center Stage,
the Lyric Opera House, Meyerhoff Symphony Hall, Morris A. Mechanic
Theatre, and Peabody Institute. Baltimore also is only an hour north of
Washington, D.C. and its treasure trove of monuments, museums,
libraries, parks, and theaters. In mid May the temperature range is
typically between 52 (11C) and 74 (23C) degrees. The relative
humidity is about 53 and there is 56% chance of sunshine.
FURTHER INFORMATION:
For further information, contact S. Rao Kosaraju, Computer Science
Department, The Johns Hopkins University, Baltimore, MD 21218. Phone
(30l) 338-8134; FAX (30l) 338-6134; email kosaraju@cs.jhu.edu.
∂21-Mar-90 1608 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Complex Systems Seminar
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 21 Mar 90 16:08:19 PST
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Wed, 21 Mar 90 16:03:36-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Wed, 21 Mar 90 16:01:26 PST
Date: Wed, 21 Mar 90 16:03 PST
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Complex Systems Seminar
To: Complex-Systems@Warbucks.AI.SRI.COM
Message-ID: <19900322000301.4.BERGMAN@HUXLEY.AI.SRI.COM>
We are pleased to anounce the second in the series of lectures
in the science of complexity:
Rationality and Learning in the Economy
W. Brian Arthur
Wednesday, April 4 1990, 1:30PM (note change of date)
Room EJ 228
W. Brian Arthur, a Morrison Profesor of Population Studies and
Economics at Stanford University, will talk about
the behavior of the economy as an evolving, complex system.
Last year Arthur directed a team of biologists, physicists and
economists at the Santa Fe Institute investigating this subject.
Address: SRI International
333 Ravenswood Ave.
Menlo Park, CA
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
-----------------------------------------------------------------------------------
Send submissions, questions, address maintenance and requests to present talks to
"complex-systems-request@AI.SRI.COM" or Bergman@AI.SRI.COM
- Aviv.
∂21-Mar-90 1805 ingrid@russell.Stanford.EDU AAAI Spring Symposium-related Seminars at SRI International
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Mar 90 18:05:01 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA21231; Wed, 21 Mar 90 17:35:33 PST
Date: Wed, 21 Mar 90 17:35:33 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003220135.AA21231@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: AAAI Spring Symposium-related Seminars at SRI International
SEMINARS AT SRI INTERNATIONAL
333 Ravenswood Avenue, Menlo Park, CA 94025
Building E
In connection with the AAAI Spring Symposium, there will be several
seminars by visitors to the AI Center at SRI International on a
variety of topics. Titles, abstracts, and dates are listed below.
VISITORS: Please arrive five minutes early so that you can be escorted
up from the E-building receptionist's desk. Thanks!
----------------------------------------------------------------------
Parsing Natural Language Using Generalized Mutual Information
David M. Magerman
University of Pennsylvania
Wednesday, 21 March, 10:00 a.m., EJ228
Host: Bob Moore
The standard approach to parsing natural language is using
grammar-based algorithms. While effective at characterizing and
classifying sentences using toy grammars, grammar-based parsing
techniques are only as robust as the grammars they use. But
characterizing concisely the entire grammar of a natural language is
an extremely difficult task.
In this talk, I will present an alternative to the grammar-based
approach, a stochastic parsing method based on finding constituent
boundaries, or distituents, using a generalized mutual information
statistic. This method, called distituent parsing, is based on the
hypothesis that constituent boundaries can be extracted from a given
part-of-speech n-gram by analyzing the mutual information values
within the n-gram. This hypothesis is supported by the performance of
an implementation of this parsing algorithm which determines all
levels of sentence structure from a variety of English text with a
relatively low error rate. During this talk, I will derive the
generalized mutual information statistic, describe the parsing
algorithm, and present results and sample output from the parser. I
will then discuss the potential applications of this approach in
conjunction with traditional grammar-based techniques.
____________
Knowledge and the Frame Problem
Leora Morgenstern
IBM, T. J. Watson Research Center
Thursday, 22 March, 3:00 p.m., EJ228
Host: Martha Pollack
The frame problem, which causes trouble for any reasonably expressive
theory of action, shows up in a strengthened form in integrated
theories of knowledge and action. In this talk, we present two
instances of this strengthened frame problem:
The Third Agent Frame Problem
- which arises in plans involving chains of communication, and
The Vicarious Planning Frame Problem
- which arises when an agent delegates a part of his plan to others.
We show that no amount of frame axioms can solve these problems, and
that most nonmonotonic temporal logics are likewise inadequate. We
then present a temporal nonmonotonic logic, Epistemic Motivated
Action Theory (EMAT), which handles both of these problems.
Finally, we discuss the relationship of Epistemic Motivated Action
Theory to general multiple agent nonmonotonic reasoning.
Specifically, we show that the principles underlying EMAT can be
recast as a restricted form of the "principle of arrogance," which
states that agents typically know what they need to know about the
limitations of other agents' beliefs.
____________
Program Synthesis Using Derivational Analogy
Sanjay Bhansali
Department of Computer Science, University of Illinois
Thursday, 22 March, 4:30 p.m., EJ228
Host: Richard Waldinger
>From an AI perspective, the goal of automatic programming is to
formalize the methodology of human programmers, so that they can be
incorporated in an interactive or automated environment. Three
important characteristics of human programmers are top-down
decomposition of complex problems, extensive use of domain knowledge,
and the ability to improve their performance by assimilating and using
past experience in solving problems.
I will describe a system APU that incorporates these characteristics
to synthesize programs for the Unix operating system domain. The main
components of APU are (1) a knowledge base of rules about programming
paradigms, problem reformulations, and Unix programming; (2) a
hierarchical planner that generates a plan by progressive refinement;
and (3) an analogical reasoner that uses analogy to speed up the
derivation of problems.
I'll first give an overview of APU and describe how it generates a
program from its specification. I will then describe the analogical
reasoner in detail. I will show why some of the earlier attempts at
using analogy -- termed solution transformation approaches -- are
inadequate for program synthesis. I will describe how APU overcomes
some of the problems associated with the earlier approaches by using
derivational analogy. Finally, I'll discuss some of the theoretical
issues involved in derivational analogy systems, namely,
appropriateness, adaptation, correspondence, and partial reuse, and
how these issues are addressed by APU.
____________
Tractable Commonsense Reasoning Using Defaults
Bart Selman
Department of Computer Science, University of Toronto
Friday, 23 March, 10:30 a.m., EJ228
Host: Kurt Konolige
Commonsense knowledge is often incomplete, and reasoning with
incomplete information is generally computationally intractable. For
example, the information "John may come by train or take a plane" can
force a system to reason by cases. We show how plausible default
assumptions can be used to obtain more complete information (by
filling in details), thereby providing a computational advantage in
commonsense reasoning systems. Although it has been previously
hypothesized that default reasoning might provide such an advantage,
this is the first rigorous demonstration of the claim.
Model-preference default theories are defined to provide a general
framework for making default assumptions. We give a detailed analysis
of the tradeoff between expressiveness and tractability as we place
various syntactic restrictions on such theories. A similar analysis
is given for Reiter's default logic, with an emphasis on efficiently
computable default theories that include strict Horn theories.
Next, we consider the complexity of defeasible inheritance -- a more
specialized default reasoning formalism used in the representation of
hierarchically organized information in semantic networks. Our
central result is that inheritance reasoning based on Touretzky's
inferential distance is NP-hard. We again identify the source of the
intractability and delineate tractable subsystems.
Finally, the relationships between these complexity results are
explored. This analysis suggests that the various tractable default
theories are closely related, thereby providing an informal
characterization of a common core of efficiently computable default
assumptions.
____________
ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner
Qiang Yang
Department of Computer Science, University of Waterloo
(Joint Work with Josh Tenenberg, University of Rochester)
Monday, 26 March, 11:00 a.m., EJ228
Host: Todd Davies
A considerable amount of research has been done in formalizing
intuitions regarding abstraction and the hierarchical problem-solving
strategies that abstraction gives rise to. However, there has been
little work in extending these formal results from linear, STRIPS-like
planners to richer temporal planners, such as least-commitment
planners. In this talk, I describe the system ABTWEAK, which extends
the precondition-elimination abstraction of ABSTRIPS to hierarchical
planners using nonlinear plan representation as defined in TWEAK. I
show that ABTWEAK satisfies the Monotonic Property, whereby the
existence of a lowest level solution P implies the existence of a
highest level solution that is structurally similar to P. This
property enables a hierarchical planner to prune a considerable amount
of the search space without loss of completeness. I also show that it
is possible for a planner that is complete in one level of abstraction
to be incomplete across multiple levels of abstraction, and propose a
globally complete control strategy for ABTWEAK. Finally, I will
discuss how ABTWEAK can be used as a theoretical tool for comparing
some of the existing hierarchical planners.
____________
The Visualized Locus Method and the Direct Method
in Motion Analysis
Masanobu Yamamoto
ETL Japan and NRC Canada
Wednesday, 28 March, 10:30 a.m., EK242
Hosts: Harlyn Baker and Bob Bolles
This talk will review the development, at ETL Japan and NRC Canada, of
two approaches to the analysis of image sequences without need of
correspondence procedures between images. One is a visualized locus
method, similar to epipolar-plane image analysis, that has been
independently developed at ETL Japan. We will describe the history of
the method at ETL, e.g., monocular and stereoscopic tracking of bodies
in motion and acquisition of 3D structure from camera motion. Another
approach is based on an extension of the conventional direct method.
With this method one can estimate both rigid and nonrigid motion
parameters using a sequence of intensity and depth images given by a
video-rate range finder. In the discussion we will give the necessary
and sufficient conditions, namely a general aperture problem, so that
the method can uniquely determine the 3D rigid motion parameters.
____________
Within the Letter of the Law: Planning in the Legal Domain
Kate Sanders
Brown University
Thursday, 29 March, 1:30 p.m., EK242
Host: Martha Pollack
Most work in AI and law has concentrated on modeling the type of
reasoning done by trial lawyers. In AI terms, this is plan evaluation
-- characterizing a sequence of actions that has already been
performed. In fact, most lawyers' work involves planning -- for
example, wills and trusts, real estate deals, and business mergers and
acquisitions. Certain planning issues, such as the need to work with
both rules and examples (statutes and cases), are illustrated
especially clearly in this domain.
In this talk, I set forth the requirements for a legal planning
system, place it in the context of past AI work in both law and
planning, and describe the design of CHIRON, a system that I am
developing in the domain of personal income tax planning.
∂22-Mar-90 1052 LOGMTC-mailer program synthesis talk today, 4:30, SRI EJ228, reminder
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 22 Mar 90 10:52:13 PST
Date: Thu 22 Mar 90 10:41:20-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: program synthesis talk today, 4:30, SRI EJ228, reminder
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, bboard@Warbucks.AI.SRI.COM,
ba-seminars@CSL.SRI.COM, logmtc%@Warbucks.AI.SRI.COM
cc: logmtc@sail.stanford.edu
Message-ID: <638131280.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
by Sanjay Bhansali
on Program Synthesis using Derivational Analogy
at 4:30 pm Thusday, 22 March
in EJ228 (SRI Building E)
Visitors please arrive early to sign in.
Apologies for multiple copies of this reminder.
-------
∂22-Mar-90 1052 LOGMTC-mailer program synthesis talk today, 4:30, SRI EJ228, reminder
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 22 Mar 90 10:52:13 PST
Date: Thu 22 Mar 90 10:41:20-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: program synthesis talk today, 4:30, SRI EJ228, reminder
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, bboard@Warbucks.AI.SRI.COM,
ba-seminars@CSL.SRI.COM, logmtc%@Warbucks.AI.SRI.COM
cc: logmtc@sail.stanford.edu
Message-ID: <638131280.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
by Sanjay Bhansali
on Program Synthesis using Derivational Analogy
at 4:30 pm Thusday, 22 March
in EJ228 (SRI Building E)
Visitors please arrive early to sign in.
Apologies for multiple copies of this reminder.
-------
∂22-Mar-90 1116 @Neon.Stanford.EDU:axwang@Theory.Stanford.EDU Special AFLB
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Mar 90 11:16:07 PST
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15880; Thu, 22 Mar 90 11:14:18 -0800
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA10887; Thu, 22 Mar 90 11:11:26 -0800
Message-Id: <9003221911.AA10887@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: Special AFLB
Date: Thu, 22 Mar 90 11:11:20 -0800
From: Alexander Wang <axwang@Theory.Stanford.EDU>
There will be no AFLB seminar today or next week. There will be
a special AFLB on Wednesday, April 4, in MJH 252 at 11:00am. The
speaker will be Leonid Levin.
Leonid Levin (Boston University)
Pseudo-Random Bits: Full Security at Last.
I will show tight relationship between two remarkable phenomena: pseudo-random
bits and one-way functions.
Function inverting is a challenging task. Consider F(x) which checks whether x
is an absolutely complete mathematical proof and outputs its length and the
last proven fact. F is trivial to compute, but inverting it amounts to finding
shortest proofs for any given theorem! Still, the problem (known as "P =? NP")
of actually proving that some functions are one-way (i.e. easy to compute while
hard to invert) remains open. Security of F is the time needed to notice that
some algorithm can successfully invert F with an observable frequency.
A reason for F being one-way may be in a particular simple predicate b(x) that
is determined by but hard to compute from F(x). Moreover, b(x) may even be
hard to guess with any noticeable correlation (then F must be one-way on most
inputs). Security of b is the time needed to notice the correlation. b(x) may
be determined by F(x) while appearing completely random. So, randomness and
determinism may be not so opposite as our scientific culture presumes.
Such (hypothetical) hidden bits play a significant role in foundations of
(pseudo)randomness, information, cryptography, and other areas. Blum, Micali
and Yao found hidden bits for functions of a special form (assuming there are
one-way ones among them). [Goldreich Levin, STOC-89] show that every one-way
function hides, with at most a polynomial security loss, almost all linear
predicates. We will see that no polynomial security loss actually occurs.
∂22-Mar-90 1122 @Neon.Stanford.EDU:axwang@Theory.Stanford.EDU Special AFLB
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Mar 90 11:22:41 PST
Received: from Jove.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16315; Thu, 22 Mar 90 11:19:43 -0800
Received: from LOCALHOST by Jove.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA08065; Thu, 22 Mar 90 11:17:24 -0800
Message-Id: <9003221917.AA08065@Jove.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: Special AFLB
Date: Thu, 22 Mar 90 11:17:14 -0800
From: Alexander Wang <axwang@Theory.Stanford.EDU>
There will be no AFLB seminar today or next week. There will be
a special AFLB on Wednesday, April 4, in MJH 252 at 11:00am. The
speaker will be Leonid Levin.
Leonid Levin (Boston University)
Pseudo-Random Bits: Full Security at Last.
I will show tight relationship between two remarkable phenomena: pseudo-random
bits and one-way functions.
Function inverting is a challenging task. Consider F(x) which checks whether x
is an absolutely complete mathematical proof and outputs its length and the
last proven fact. F is trivial to compute, but inverting it amounts to finding
shortest proofs for any given theorem! Still, the problem (known as "P =? NP")
of actually proving that some functions are one-way (i.e. easy to compute while
hard to invert) remains open. Security of F is the time needed to notice that
some algorithm can successfully invert F with an observable frequency.
A reason for F being one-way may be in a particular simple predicate b(x) that
is determined by but hard to compute from F(x). Moreover, b(x) may even be
hard to guess with any noticeable correlation (then F must be one-way on most
inputs). Security of b is the time needed to notice the correlation. b(x) may
be determined by F(x) while appearing completely random. So, randomness and
determinism may be not so opposite as our scientific culture presumes.
Such (hypothetical) hidden bits play a significant role in foundations of
(pseudo)randomness, information, cryptography, and other areas. Blum, Micali
and Yao found hidden bits for functions of a special form (assuming there are
one-way ones among them). [Goldreich Levin, STOC-89] show that every one-way
function hides, with at most a polynomial security loss, almost all linear
predicates. We will see that no polynomial security loss actually occurs.
∂22-Mar-90 1340 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Looking for an algorithm
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Mar 90 13:39:56 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24888; Thu, 22 Mar 90 13:36:24 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10206; Thu, 22 Mar 90 13:36:25 -0800
Message-Id: <9003222136.AA10206@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2769; Thu, 22 Mar 90 15:33:30 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2755; Thu, 22 Mar 90 15:27:43 CST
Date: Thu, 22 Mar 90 15:19:32 CST
Reply-To: Chen Wei <chen%shinobu.ics.osaka-u.ac.jp@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Chen Wei <chen%shinobu.ics.osaka-u.ac.jp@VM1.NoDak.EDU>
Subject: Looking for an algorithm
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am Wei Chen.I am a graduate student in Oosaka University,
Japan.
I am working at the problems about finding intersections
of polygons recently. It was known the problem of testing
whether two n-vertex simple polygons intersect can be sloved
in time O(nlogn) and the lower bound of time for computing
this intersection is c*(nlogn+k)
(c is constant,k is the number of vertices of intersection).
But it seems there isn't any algorithm for computing inter-
section of two n-vertex simply polygons. if who knows it ,
please tell me. No matter how much time it uses and no matter
sequential algorithm or parallel algorithm.
Thank you.
---
Chen Wei
chen@ics.osaka-u.ac.jp
∂22-Mar-90 1340 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Interval graphs
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Mar 90 13:35:28 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24609; Thu, 22 Mar 90 13:30:37 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09872; Thu, 22 Mar 90 13:28:42 -0800
Message-Id: <9003222128.AA09872@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2612; Thu, 22 Mar 90 15:25:40 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2594; Thu, 22 Mar 90 15:25:36 CST
Date: Thu, 22 Mar 90 15:18:17 CST
Reply-To: THEORYNT%YKTVMZ.BITNET@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: THEORYNT%YKTVMZ.BITNET@VM1.NoDak.EDU
Subject: Interval graphs
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Could somebody provide me with some reference on efficient
matching algorithms on interval graphs ?
Thanks in advance,
Afonso Ferreira
ferreira@frensl61.bitnet
ferreira@lip.ens-lyon.fr
∂22-Mar-90 1340 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Knapsack problem
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Mar 90 13:35:38 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24613; Thu, 22 Mar 90 13:30:45 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09993; Thu, 22 Mar 90 13:31:03 -0800
Message-Id: <9003222131.AA09993@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2732; Thu, 22 Mar 90 15:29:06 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2704; Thu, 22 Mar 90 15:26:35 CST
Date: Thu, 22 Mar 90 15:18:36 CST
Reply-To: Daniel Geist <dg0951%cec1.wustl.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Daniel Geist <dg0951%cec1.wustl.edu@VM1.NoDak.EDU>
Subject: Knapsack problem
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The knapsack problem is a very well known 0-1 programming
problem:
__n __n
Maximize \ \
/_ Ci*Xi provided that /_Vi*Xi <= Vo
i=1 i=1
The problem itself is NP for Ci,Vi real. However I wonder
if given the optimal solution there is a way to determine
the "second best" solution in polynomial time?
Danny Geist
∂22-Mar-90 1400 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Mar 90 14:00:38 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA11036; Thu, 22 Mar 90 14:00:30 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA24005; Thu, 22 Mar 90 13:59:04 -0800
Date: Thu, 22 Mar 1990 13:59:03 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU, phd@cs.Stanford.EDU, res-assoc@cs.Stanford.EDU
Message-Id: <CMM.0.88.638143143.tajnai@Hudson.Stanford.EDU>
A reminder that the Sunrise Club meets Tuesday, 7:30 a.m. at
Tresidder. So far there are not many people signed up. Hope you can
make it!!
Carolyn
---------------
Return-Path: <@Sunburn.Stanford.EDU:NA.PHL@Forsythe.Stanford.EDU>
Received: from Sunburn.Stanford.EDU by Hudson.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20377; Fri, 16 Mar 90 07:37:25 -0800
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02312; Fri, 16 Mar 90 07:38:27 -0800
Message-Id: <9003161538.AA02312@Sunburn.Stanford.EDU>
Date: Fri, 16 Mar 90 07:36:52 PST
To: faculty@cs.Stanford.EDU
From: "Portia Leet" <NA.PHL@Forsythe.Stanford.EDU>
SCHOOL OF ENGINEERING
MEMORANDUM
March 16, 1990
TO: Faculty, Staff and Students
FROM: Portia Leet
Events Coordinator
RE: Sunrise Club Meeting
March 27, 1990
Professor Ronald K. Hanson of the Mechanical Engineering Department
will address the Sunrise Club on Tuesday, March 27th. His topic
will be "Laser-based Fluorescent Imaging in Gases." The breakfast
meeting begins at 7:30 a.m. at Tresidder Union Oak Lounge West.
Ron Hanson formulates laser-based diagnostic methods to measure the
fundamental physical and chemical parameters of high-temperature
reactive gas flows. In addition to his work with shock tubes, he
develops laser-induced fluorescence techniques for 2-dimensional
imaging in gaseous flows.
If you plan to attend, please respond to na.phl@forsythe or by
phone 5-1585.
To: SUNRISE(CT.JFK,CT.MJF,CT.PAC,CT.VLS,DOWN@SIERRA,EE-FACULTY@SIERRA,
FACULTY@CS,FULLERTON@SIERRA,GD.WRK,GIBBONS@SIERRA,HAGSTROM@SIERRA,
KINO@SIERRA,KRUGER@SIERRA,LEVINTHAL@SIERRA,NA.ADP,NA.PHL,PHD@CS,
REIS@SIERRA,RES-ASSOC@CS,TAJNAI@CS)
∂23-Mar-90 0756 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU 2nd-best packings
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 07:56:24 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA14577; Fri, 23 Mar 90 07:56:28 -0800
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14614; Fri, 23 Mar 90 07:55:54 -0800
Message-Id: <9003231555.AA14614@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3608; Fri, 23 Mar 90 09:53:04 CST
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3575; Fri, 23 Mar 90 09:53:00 CST
Date: Fri, 23 Mar 90 09:50:52 CST
Reply-To: Peter Winkler <pw%flash.bellcore.com@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMZ
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Peter Winkler <pw%flash.bellcore.com@VM1.NoDak.EDU>
Subject: 2nd-best packings
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Replying to:
The knapsack problem is a very well known 0-1 programming
problem:
__n __n
Maximize \ \
/_ Ci*Xi provided that /_Vi*Xi <= Vo
i=1 i=1
The problem itself is NP for Ci,Vi real. However I wonder
if given the optimal solution there is a way to determine
the "second best" solution in polynomial time?
Danny Geist
Given an instance of KNAPSACK one may add another "object" n+1
with V(n+1) = Vo, and C(n+1) > sum Ci, forcing "Xi = 1 iff i =
n+1" to be the best assignment. All other assignments will satisfy
X(n+1) = 0 and thus be valid for the original problem. Thus, to find the
second (or k-th) best assignment is as hard as to find the best.
This behavior is typical of NP-hard problems. For example, given a
graph and a three-coloring, it's NP-hard to find another one.
-Pete Winkler
∂23-Mar-90 0832 PHY sail and spider
John, I'm so sorry that wonderful SAIL will be disappearing on June 1.
I have become adjusted to EMACS and UNIX -- but ...
But the most important problem -- what about SPIDER? Is there some
way it can be moved to the unix system and I can access it with my
sunburn account? Please and thank you. -Phyllis Winkler
∂23-Mar-90 0942 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Two Vitanyi talks
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 09:42:33 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18236; Fri, 23 Mar 90 09:40:36 -0800
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21449; Fri, 23 Mar 90 09:40:56 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA03574; Fri, 23 Mar 90 09:40:58 PST
Date: Fri, 23 Mar 90 09:40:58 PST
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9003231740.AA03574@coraki.stanford.edu>
To: aflb-all@cs.Stanford.EDU, su-events@cs.Stanford.EDU
Subject: Two Vitanyi talks
Paul Vitanyi of CWI and the University of Amsterdam will give the
following two talks on Kolmogoroff complexity next week. Both talks
will be in Margaret Jacks Hall room 352.
Thursday, March 29, 4:15: Introduction to Kolmogorov Complexity
Friday, March 30, 10:00: Inductive Reasoning and Kolmogorov Complexity
Professor Vitanyi will also present a paper at the AAAI-90 Spring
Symposium at Stanford, March 27-29, entitled "Two Applications of the
Universal Distribution." Consult the symposium program for details.
Vaughan Pratt
∂23-Mar-90 1015 LOGMTC-mailer program synthesis seminar weds. 3/28, 4:30pm, SRI EJ228
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 23 Mar 90 10:15:19 PST
Date: Fri 23 Mar 90 10:03:00-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: program synthesis seminar weds. 3/28, 4:30pm, SRI EJ228
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@sail.stanford.edu,
ba-seminars@CSL.SRI.COM, colloq@cs.stanford.edu,
bboard@Warbucks.AI.SRI.COM, su-bboards@cs.stanford.edu
Message-ID: <638215381.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
Speaker: Henson Graves
Title: Automatic Programming at Lockheed
When: Wednesday, 28 March, 4:30 pm
Where: AI Center Conference Room Ej228
SRI International
333 Ravenswood Av.
Engineering Building (E)
Abstract:
The Software Automation Project at Lockheed is building an automatic
programming system, Lockheed Environment for Automatic Programming
(LEAP). LEAP can be used by system engineers to synthesize Ada code
from high-level requirements specifications. LEAP has a reusable
knowledge base of application knowledge, design templates, and design
rules. An inference engine uses the knowledge base to synthesize the
code from the user's input. At the present time most of the synthesis
capability is operational.
We believe that the approach to code synthesis that we are taking
offers the promise of solving well known hard problems of automatic
programming. I will discuss this approach and look briefly at the
formal foundation, which is deductive synthesis at a meta-level.
Visitors please arrive early to sign in.
Visitors from certain US-designated countries
must make prior arrangements to get in.
(Call Dori Arceo, 859-2641)
Apologies for multiple copies of this announcement.
-------
∂23-Mar-90 1015 LOGMTC-mailer program synthesis seminar weds. 3/28, 4:30pm, SRI EJ228
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 23 Mar 90 10:15:19 PST
Date: Fri 23 Mar 90 10:03:00-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: program synthesis seminar weds. 3/28, 4:30pm, SRI EJ228
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@sail.stanford.edu,
ba-seminars@CSL.SRI.COM, colloq@cs.stanford.edu,
bboard@Warbucks.AI.SRI.COM, su-bboards@cs.stanford.edu
Message-ID: <638215381.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
Speaker: Henson Graves
Title: Automatic Programming at Lockheed
When: Wednesday, 28 March, 4:30 pm
Where: AI Center Conference Room Ej228
SRI International
333 Ravenswood Av.
Engineering Building (E)
Abstract:
The Software Automation Project at Lockheed is building an automatic
programming system, Lockheed Environment for Automatic Programming
(LEAP). LEAP can be used by system engineers to synthesize Ada code
from high-level requirements specifications. LEAP has a reusable
knowledge base of application knowledge, design templates, and design
rules. An inference engine uses the knowledge base to synthesize the
code from the user's input. At the present time most of the synthesis
capability is operational.
We believe that the approach to code synthesis that we are taking
offers the promise of solving well known hard problems of automatic
programming. I will discuss this approach and look briefly at the
formal foundation, which is deductive synthesis at a meta-level.
Visitors please arrive early to sign in.
Visitors from certain US-designated countries
must make prior arrangements to get in.
(Call Dori Arceo, 859-2641)
Apologies for multiple copies of this announcement.
-------
∂23-Mar-90 1036 LOGMTC-mailer what is the name of this list
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 10:36:31 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25111; Fri, 23 Mar 90 10:37:43 -0800
Date: Fri, 23 Mar 90 10:37:43 -0800
From: Vaughan R. Pratt <pratt@Sunburn.Stanford.EDU>
Message-Id: <9003231837.AA25111@Sunburn.Stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: what is the name of this list
It would be nice if this list had an easily remembered name on cs.
(It is currently post-csd-logic@cs.) What do people think of the
name "logic@cs"? (L@CS instead of LiCS.)
-v
∂23-Mar-90 1037 LOGMTC-mailer Two Vitanyi talks
Received: from coraki.stanford.edu by SAIL.Stanford.EDU with TCP; 23 Mar 90 10:37:19 PST
Received: by coraki.stanford.edu (4.0/25-eef) id AA03801; Fri, 23 Mar 90 10:38:32 PST
Message-Id: <9003231838.AA03801@coraki.stanford.edu>
To: paco@cs.stanford.edu, logmtc@sail.stanford.edu
Subject: Two Vitanyi talks
Date: 23 Mar 90 10:38:32 PST (Fri)
From: pratt@cs.stanford.edu
------- Forwarded Message
Date: Fri, 23 Mar 90 09:40:58 PST
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9003231740.AA03574@coraki.stanford.edu>
To: aflb-all@cs.Stanford.EDU, su-events@cs.Stanford.EDU
Subject: Two Vitanyi talks
Paul Vitanyi of CWI and the University of Amsterdam will give the
following two talks on Kolmogoroff complexity next week. Both talks
will be in Margaret Jacks Hall room 352.
Thursday, March 29, 4:15: Introduction to Kolmogorov Complexity
Friday, March 30, 10:00: Inductive Reasoning and Kolmogorov Complexity
Professor Vitanyi will also present a paper at the AAAI-90 Spring
Symposium at Stanford, March 27-29, entitled "Two Applications of the
Universal Distribution." Consult the symposium program for details.
Vaughan Pratt
------- End of Forwarded Message
∂23-Mar-90 1101 @Sunburn.Stanford.EDU:ango@Jinn.Stanford.EDU Levin's visit
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 11:01:06 PST
Received: from Jinn.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02187; Fri, 23 Mar 90 11:00:35 -0800
Received: by Jinn.Stanford.EDU (4.0/25-eef) id AA22473; Fri, 23 Mar 90 11:00:43 PST
Date: Fri, 23 Mar 90 11:00:43 PST
From: Andrew Goldberg <ango@jinn.Stanford.EDU>
Message-Id: <9003231900.AA22473@Jinn.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Levin's visit
Leonid Levin of Boston University will give a talk on a special AFLB
seminar at 11:00 on April 4 in MJH 252. The talk title is
"PSEUDO-RANDOM BITS: FULL SECURITY AT LAST".
He also will give a talk at Berkeley on April 2 on "AVERAGE-CASE
NP-COMPLETENESS FOR ALL SAMPLABLE DISTRIBUTIONS".
Professor Levin will be around on April 3.
Please let me know if you would like to talk to him.
(Leonid Levin is well-known for his work in complexity theory; for example,
he is a co-inventor of NP-completeness.)
--Andrew
∂23-Mar-90 1110 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report Column for March
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 11:09:55 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04311; Fri, 23 Mar 90 11:09:55 -0800
Date: Fri, 23 Mar 1990 11:09:54 PST
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report Column for March
28, 1990 ]
Message-Id: <CMM.0.88.638219394.bergman@Sunburn.Stanford.EDU>
Following is an excerpt from the SPO Campus Report Column
for March 28.
-Sharon Bergman
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
Notice: NSF's Undergraduate Curriculum and Course Development in
Engineering, Mathematics and the Sciences
The deadline for the NSF Curriculum program has been changed from
April 9, 1990 to Oct. 15, 1990. The bad news is that no 1990 money
will be spent on this program.
∂23-Mar-90 1257 LOGMTC-mailer Re: what is the name of this list
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 12:57:19 PST
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA01941; Fri, 23 Mar 90 12:58:05 -0800
Date: Fri, 23 Mar 90 20:57:59 GMT
From: weening@Gang-of-Four.Stanford.EDU (Joe Weening)
Organization: Computer Science Department, Stanford University
Subject: Re: what is the name of this list
Message-Id: <1990Mar23.205759.1879@Neon.Stanford.EDU>
References: <9003231837.AA25111@Sunburn.Stanford.EDU>
Sender: logmtc-mailer@sail.stanford.edu
To: logmtc@sail.stanford.edu
In article <9003231837.AA25111@Sunburn.Stanford.EDU> pratt@SUNBURN.STANFORD.EDU (Vaughan R. Pratt) writes:
It would be nice if this list had an easily remembered name on cs.
(It is currently post-csd-logic@cs.) What do people think of the
name "logic@cs"? (L@CS instead of LiCS.)
post-csd-logic@cs (or @neon) is, in fact, an intentionally obscure
name meant for use only by machines. It will cause a message to be
posted to csd.logic but *not* be sent to people on the associated
mailing list. (This is how mail to the mailing list is posted to the
newsgroup without causing duplication.) At present, the correct way
to send a message is to either:
post to csd.logic using a USENET program (postnews, Pnews, etc.)
or
mail to the mailing list logmtc@sail.stanford.edu
We could set up an alias "logic@cs" (or "csd-logic@cs" or "logmtc@cs")
to point to the mailing list address.
--
Joe Weening Computer Science Dept.
weening@Gang-of-Four.Stanford.EDU Stanford University
∂23-Mar-90 1623 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU VIP from Mitterrand of France
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 16:23:32 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16757; Fri, 23 Mar 90 16:23:58 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA00585; Fri, 23 Mar 90 16:22:36 -0800
Date: Fri, 23 Mar 1990 16:22:35 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@Hudson.Stanford.EDU
Cc: fullerton@sierra.Stanford.EDU, kruger@sierra.Stanford.EDU,
gibbons@sierra.Stanford.EDU, linvill@sierra.Stanford.EDU
Subject: VIP from Mitterrand of France
Message-Id: <CMM.0.88.638238155.tajnai@Hudson.Stanford.EDU>
I just received a call from the French Consulate. Charles Salzmann,
who is scientific counselor to President Mitterrand for Computer Science
and Data Processing. He was scheduled to see John Hennessy from 10:30
to 11:30, but John has been called out of town and had to cancel.
I suggested he come at 7:30 for Sunrise breakfast, but that is a bit
early to get here from SF. Would one or two of you like to meet with
Mr. Salzmann around 10:00. Maybe take him to lunch? Please respond
as quickly as possible. I'll call the Consulate on Monday morning
to give them the schedule.
Carolyn
∂23-Mar-90 1651 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Re: VIP from Mitterrand of France
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Mar 90 16:51:52 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17259; Fri, 23 Mar 90 16:50:23 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA00829; Fri, 23 Mar 90 16:48:55 -0800
Date: Fri, 23 Mar 1990 16:48:55 PST
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
Cc: faculty@Hudson.Stanford.EDU, fullerton@sierra.Stanford.EDU,
kruger@sierra.Stanford.EDU, gibbons@sierra.Stanford.EDU,
linvill@sierra.Stanford.EDU
Subject: Re: VIP from Mitterrand of France
In-Reply-To: Your message of Fri, 23 Mar 1990 16:22:35 PST
Message-Id: <CMM.0.88.638239735.tajnai@Hudson.Stanford.EDU>
The date for the visit is Tuesday, 27 March.
∂26-Mar-90 1430 chandler@Sunburn.Stanford.EDU DARPA Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Mar 90 14:30:40 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26074; Mon, 26 Mar 90 14:30:49 -0800
Date: Mon, 26 Mar 1990 14:30:48 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: DARPA Publication
Message-Id: <CMM.0.88.638490648.chandler@Sunburn.Stanford.EDU>
I have received the following publication from DARPA. It is available if you
would like to borrow it:
Knowledge-Based Logistics Planning and its Application in Manufacturing and
Strategic Planning, CMU, Mark S. Fox and Katia P. Sycara, sponsored by DARPA.
∂26-Mar-90 1513 taleen@Sunburn.Stanford.EDU Please
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Mar 90 15:13:41 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25755; Mon, 26 Mar 90 14:19:02 -0800
Date: Mon, 26 Mar 1990 14:19:01 PST
From: "Taleen M. Nazarian" <taleen@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: Please
Message-Id: <CMM.0.88.638489941.taleen@Sunburn.Stanford.EDU>
Will the person who borrowed my red binder containing all my publications
announcements return it to me as soon as possible? Please? Please?
PLEASE??????????
Thank you!
Taleen
MJH 206
∂26-Mar-90 1558 taleen@Sunburn.Stanford.EDU No need for further concern
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Mar 90 15:58:16 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27446; Mon, 26 Mar 90 15:19:14 -0800
Date: Mon, 26 Mar 1990 15:19:13 PST
From: "Taleen M. Nazarian" <taleen@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: No need for further concern
Message-Id: <CMM.0.88.638493553.taleen@Sunburn.Stanford.EDU>
I'm sure you all were worried about my missing binder. ;-)
Well, you can sleep easy tonight. One alert secretary in the department
noticed that someone had it.
Thank you for your concern, everyone! Yet another mystery solved for
the Computer Science Department......!
Taleen
∂26-Mar-90 1629 keyes@sierra.Stanford.EDU Faculty Meeting
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Mar 90 16:29:47 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 26 Mar 90 16:26:35 PST
Date: Mon, 26 Mar 90 16:26:35 PST
From: keyes@sierra.Stanford.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.Stanford.EDU
Subject: Faculty Meeting
Message-Id: <CMM.0.88.638497594.keyes@>
There will be FACULTY MEETING on Wed., April 4, at 11:00 AM in McCullough
240. The agenda will include:
Degree conferral
Report of the Quals Review Committee
Thank you.
Gloria
∂27-Mar-90 1139 LOGMTC-mailer Decision problems for propositional linear logic: addendum
Received: from argon.csl.sri.com by SAIL.Stanford.EDU with TCP; 27 Mar 90 11:39:17 PST
Received: by argon.csl.sri.com at Tue, 27 Mar 90 11:33:50 -0800.
(5.61.11/XIDA-1.2.8.27) id AA16453 for logmtc@sail.Stanford.EDU
Date: Tue, 27 Mar 90 11:33:50 -0800
From: Natarajan Shankar <shankar@csl.sri.com>
Message-Id: <9003271933.AA16453@argon.csl.sri.com>
To: types@theory.lcs.mit.edu
Cc: logmtc@sail.Stanford.EDU
Subject: Decision problems for propositional linear logic: addendum
Addendum to "Decision Problems for propositional linear logic"
P. Lincoln, J. Mitchell, A. Scedrov, N. Shankar
We wish to add the following results to our recently announced work on
the decidability/complexity/undecidability of various fragments of
propositional linear logic:
1. Provability for the linear logic of (tensor, par, with, plus,
negation), i.e., the non-exponential fragment, is PSPACE-complete.
The PSPACE upper bound was claimed in our earlier announcement.
PSPACE-hardness is demonstrated by a transformation from the QBF
(Quantified Boolean Formula) validity problem.
2. Provability for multiplicative fragment of linear logic with
unrestricted weakening (Ketonen-Weyhrauch's "Direct logic") is
NP-complete. Membership in NP follows from a polynomial upper bound
on the size of cut-free proofs. NP-hardness is proved by a
transformation from the Vertex Cover problem.